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.02k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
   52|  2.02k|  if (!g_processor || size < 2)
  ------------------
  |  Branch (52:7): [True: 0, False: 2.02k]
  |  Branch (52:23): [True: 1, False: 2.02k]
  ------------------
   53|      1|    return 0;
   54|       |
   55|  2.02k|  FuzzedDataProvider fdp(data, size);
   56|  2.02k|  uint8_t ops = fdp.ConsumeIntegral<uint8_t>();
   57|  2.02k|  std::string text = fdp.ConsumeRemainingBytesAsString();
   58|       |
   59|       |  // === Core encoding operations ===
   60|  2.02k|  if (ops & 0x01) {
  ------------------
  |  Branch (60:7): [True: 1.40k, False: 624]
  ------------------
   61|       |    // Encode to pieces (strings)
   62|  1.40k|    std::vector<std::string> pieces;
   63|  1.40k|    g_processor->Encode(text, &pieces);
   64|       |
   65|       |    // Decode back from pieces
   66|  1.40k|    if (!pieces.empty()) {
  ------------------
  |  Branch (66:9): [True: 1.37k, False: 23]
  ------------------
   67|  1.37k|      std::string decoded;
   68|  1.37k|      g_processor->Decode(pieces, &decoded);
   69|  1.37k|    }
   70|  1.40k|  }
   71|       |
   72|  2.02k|  if (ops & 0x02) {
  ------------------
  |  Branch (72:7): [True: 1.42k, False: 604]
  ------------------
   73|       |    // Encode to IDs
   74|  1.42k|    std::vector<int> ids;
   75|  1.42k|    g_processor->Encode(text, &ids);
   76|       |
   77|       |    // Decode back from IDs
   78|  1.42k|    if (!ids.empty()) {
  ------------------
  |  Branch (78:9): [True: 1.40k, False: 20]
  ------------------
   79|  1.40k|      std::string decoded;
   80|  1.40k|      g_processor->Decode(ids, &decoded);
   81|  1.40k|    }
   82|  1.42k|  }
   83|       |
   84|       |  // === Advanced encoding operations ===
   85|  2.02k|  if (ops & 0x04) {
  ------------------
  |  Branch (85:7): [True: 1.32k, False: 704]
  ------------------
   86|       |    // NBest encoding - use small nbest to avoid being too slow
   87|  1.32k|    std::vector<std::vector<std::string>> nbest_pieces;
   88|  1.32k|    g_processor->NBestEncode(text, 3, &nbest_pieces);
   89|       |
   90|       |    // NBest encode to IDs
   91|  1.32k|    std::vector<std::vector<int>> nbest_ids;
   92|  1.32k|    g_processor->NBestEncode(text, 3, &nbest_ids);
   93|  1.32k|  }
   94|       |
   95|  2.02k|  if (ops & 0x08) {
  ------------------
  |  Branch (95:7): [True: 1.23k, False: 787]
  ------------------
   96|       |    // Sample encoding with various alpha values
   97|  1.23k|    std::vector<std::string> sampled;
   98|  1.23k|    g_processor->SampleEncode(text, -1, 0.5, &sampled);
   99|       |
  100|  1.23k|    std::vector<int> sampled_ids;
  101|  1.23k|    g_processor->SampleEncode(text, -1, 0.1, &sampled_ids);
  102|  1.23k|  }
  103|       |
  104|  2.02k|  if (ops & 0x10) {
  ------------------
  |  Branch (104:7): [True: 1.34k, False: 678]
  ------------------
  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.34k|    auto pieces = g_processor->EncodeAsPieces(text);
  109|  1.34k|    (void)pieces;
  110|       |
  111|  1.34k|    auto nb_pieces = g_processor->NBestEncodeAsPieces(text, 2);
  112|  1.34k|    (void)nb_pieces;
  113|       |
  114|  1.34k|    auto sample_pieces = g_processor->SampleEncodeAsPieces(text, -1, 0.5);
  115|  1.34k|    (void)sample_pieces;
  116|  1.34k|  }
  117|       |
  118|       |  // === Normalization ===
  119|  2.02k|  if (ops & 0x20) {
  ------------------
  |  Branch (119:7): [True: 1.47k, False: 546]
  ------------------
  120|  1.47k|    std::string normalized;
  121|  1.47k|    g_processor->Normalize(text, &normalized);
  122|       |
  123|       |    // Normalize with alignment info
  124|  1.47k|    std::string normalized2;
  125|  1.47k|    std::vector<size_t> norm_to_orig;
  126|  1.47k|    g_processor->Normalize(text, &normalized2, &norm_to_orig);
  127|  1.47k|  }
  128|       |
  129|       |  // === Vocabulary operations ===
  130|  2.02k|  if (ops & 0x40) {
  ------------------
  |  Branch (130:7): [True: 1.45k, False: 573]
  ------------------
  131|       |    // PieceToId with fuzz text
  132|  1.45k|    g_processor->PieceToId(text);
  133|       |
  134|       |    // Try splitting text into substrings and looking them up
  135|  1.45k|    if (text.size() > 2) {
  ------------------
  |  Branch (135:9): [True: 1.38k, False: 68]
  ------------------
  136|  11.7k|      for (size_t i = 0; i < text.size() && i < 8; i++) {
  ------------------
  |  Branch (136:26): [True: 11.5k, False: 210]
  |  Branch (136:45): [True: 10.3k, False: 1.17k]
  ------------------
  137|  10.3k|        std::string sub = text.substr(0, i + 1);
  138|  10.3k|        int id = g_processor->PieceToId(sub);
  139|  10.3k|        if (id >= 0 && id < g_processor->GetPieceSize()) {
  ------------------
  |  Branch (139:13): [True: 10.3k, False: 0]
  |  Branch (139:24): [True: 10.3k, False: 0]
  ------------------
  140|  10.3k|          g_processor->IdToPiece(id);
  141|  10.3k|          g_processor->GetScore(id);
  142|  10.3k|          g_processor->IsUnknown(id);
  143|  10.3k|          g_processor->IsControl(id);
  144|  10.3k|          g_processor->IsUnused(id);
  145|  10.3k|          g_processor->IsByte(id);
  146|  10.3k|        }
  147|  10.3k|      }
  148|  1.38k|    }
  149|  1.45k|  }
  150|       |
  151|       |  // Upstream removed CalculateEntropy(). Exercise the sampling path it used
  152|       |  // to sit on instead, so this branch still does work.
  153|  2.02k|  if (ops & 0x80) {
  ------------------
  |  Branch (153:7): [True: 1.19k, False: 833]
  ------------------
  154|  1.19k|    if (text.size() > 0 && text.size() < 256) {
  ------------------
  |  Branch (154:9): [True: 1.19k, False: 0]
  |  Branch (154:28): [True: 738, False: 453]
  ------------------
  155|    738|      auto sampled_pieces = g_processor->SampleEncodeAsPieces(text, 8, 0.5);
  156|    738|      (void)sampled_pieces;
  157|    738|    }
  158|  1.19k|  }
  159|       |
  160|  2.02k|  return 0;
  161|  2.02k|}

_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|  7.49k|    once_flag* absl_nonnull flag) {
  196|  7.49k|  return &flag->control_;
  197|  7.49k|}
_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|  7.49k|    call_once(absl::once_flag& flag, Callable&& fn, Args&&... args) {
  216|  7.49k|  std::atomic<uint32_t>* once = base_internal::ControlWord(&flag);
  217|  7.49k|  uint32_t s = once->load(std::memory_order_acquire);
  218|  7.49k|  if (ABSL_PREDICT_FALSE(s != base_internal::kOnceDone)) {
  ------------------
  |  |  190|  7.49k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 1, False: 7.49k]
  |  |  |  Branch (190:49): [Folded, False: 7.49k]
  |  |  |  Branch (190:58): [True: 1, False: 7.49k]
  |  |  ------------------
  ------------------
  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|  7.49k|}
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|  7.49k|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|  39.6M|inline uint64_t ToHost64(uint64_t x) { return x; }
_ZN4absl12lts_2026081713little_endian6ToHostEm:
  136|  38.0M|inline uint64_t ToHost(uint64_t x) { return ToHost64(x); }
_ZN4absl12lts_2026081713little_endian7Store16EPvt:
  164|  7.49k|inline void Store16(void* absl_nonnull p, uint16_t v) {
  165|  7.49k|  ABSL_INTERNAL_UNALIGNED_STORE16(p, FromHost16(v));
  ------------------
  |  |   81|  7.49k|  (absl::base_internal::UnalignedStore16(_p, _val))
  ------------------
  166|  7.49k|}
_ZN4absl12lts_2026081713little_endian6Load64EPKv:
  176|  1.60M|inline uint64_t Load64(const void* absl_nonnull p) {
  177|  1.60M|  return ToHost64(ABSL_INTERNAL_UNALIGNED_LOAD64(p));
  ------------------
  |  |   78|  1.60M|  (absl::base_internal::UnalignedLoad64(_p))
  ------------------
  178|  1.60M|}
_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|  7.49k|  ErrnoSaver() : saved_errno_(errno) {}
_ZN4absl12lts_2026081713base_internal10ErrnoSaverD2Ev:
   32|  7.49k|  ~ErrnoSaver() { errno = saved_errno_; }

_ZN4absl12lts_2026081713base_internal17HardeningAssertLTImmEEvT_T0_:
   92|   382M|constexpr void HardeningAssertLT(T1 val1, T2 val2) {
   93|   382M|  ABSL_ASSERT(val1 < val2);
  ------------------
  |  |  131|   382M|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  ------------------
  |  |  |  |   87|   382M|#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|   382M|}
_ZN4absl12lts_2026081713base_internal17HardeningAssertLEImmEEvT_T0_:
  102|  52.0M|constexpr void HardeningAssertLE(T1 val1, T2 val2) {
  103|  52.0M|  ABSL_ASSERT(val1 <= val2);
  ------------------
  |  |  131|  52.0M|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  ------------------
  |  |  |  |   87|  52.0M|#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|  52.0M|}
_ZN4absl12lts_2026081713base_internal17HardeningAssertGEImmEEvT_T0_:
   82|  52.9M|constexpr void HardeningAssertGE(T1 val1, T2 val2) {
   83|  52.9M|  ABSL_ASSERT(val1 >= val2);
  ------------------
  |  |  131|  52.9M|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  ------------------
  |  |  |  |   87|  52.9M|#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|  52.9M|}

_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|  7.49k|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|  7.49k|#if defined(ABSL_HAVE_THREAD_LOCAL) && \
  499|  7.49k|    !defined(ABSL_INTERNAL_USING_EMULATED_TLS)
  500|  7.49k|  static thread_local pid_t thread_id = GetTID();
  501|  7.49k|  return thread_id;
  502|       |#else
  503|       |  return GetTID();
  504|       |#endif  // defined(ABSL_HAVE_THREAD_LOCAL) &&
  505|       |        // !defined(ABSL_INTERNAL_USING_EMULATED_TLS)
  506|  7.49k|#undef ABSL_INTERNAL_USING_EMULATED_TLS
  507|  7.49k|}

_ZN4absl12lts_2026081713base_internal15UnalignedLoad32EPKv:
   45|   515M|inline uint32_t UnalignedLoad32(const void* absl_nonnull p) {
   46|   515M|  uint32_t t;
   47|   515M|  memcpy(&t, p, sizeof t);
   48|   515M|  return t;
   49|   515M|}
_ZN4absl12lts_2026081713base_internal15UnalignedLoad64EPKv:
   51|   958M|inline uint64_t UnalignedLoad64(const void* absl_nonnull p) {
   52|   958M|  uint64_t t;
   53|   958M|  memcpy(&t, p, sizeof t);
   54|   958M|  return t;
   55|   958M|}
_ZN4absl12lts_2026081713base_internal16UnalignedStore16EPvt:
   57|  7.49k|inline void UnalignedStore16(void* absl_nonnull p, uint16_t v) {
   58|  7.49k|  memcpy(p, &v, sizeof v);
   59|  7.49k|}
_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|  7.49k|constexpr const char* LogSeverityName(absl::LogSeverity s) {
  102|  7.49k|  switch (s) {
  ------------------
  |  Branch (102:11): [True: 7.49k, False: 0]
  ------------------
  103|      0|    case absl::LogSeverity::kInfo: return "INFO";
  ------------------
  |  Branch (103:5): [True: 0, False: 7.49k]
  ------------------
  104|  7.49k|    case absl::LogSeverity::kWarning: return "WARNING";
  ------------------
  |  Branch (104:5): [True: 7.49k, False: 0]
  ------------------
  105|      0|    case absl::LogSeverity::kError: return "ERROR";
  ------------------
  |  Branch (105:5): [True: 0, False: 7.49k]
  ------------------
  106|      0|    case absl::LogSeverity::kFatal: return "FATAL";
  ------------------
  |  Branch (106:5): [True: 0, False: 7.49k]
  ------------------
  107|  7.49k|  }
  108|      0|  return "UNKNOWN";
  109|  7.49k|}
_ZN4absl12lts_2026081720NormalizeLogSeverityENS0_11LogSeverityE:
  115|  7.49k|constexpr absl::LogSeverity NormalizeLogSeverity(absl::LogSeverity s) {
  116|  7.49k|  absl::LogSeverity n = s;
  117|  7.49k|  if (n < absl::LogSeverity::kInfo) n = absl::LogSeverity::kInfo;
  ------------------
  |  Branch (117:7): [True: 0, False: 7.49k]
  ------------------
  118|  7.49k|  if (n > absl::LogSeverity::kFatal) n = absl::LogSeverity::kError;
  ------------------
  |  Branch (118:7): [True: 0, False: 7.49k]
  ------------------
  119|  7.49k|  return n;
  120|  7.49k|}
_ZN4absl12lts_20260817ltENS0_11LogSeverityENS0_18LogSeverityAtLeastE:
  165|  14.9k|  constexpr bool operator op2(absl::LogSeverity lhs, absl::T rhs) { \
  166|  14.9k|    return lhs op2 static_cast<absl::LogSeverity>(rhs);             \
  167|  14.9k|  }

_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|   210M|  const T& operator*() const { return *get(); }
_ZNK4absl12lts_2026081712NoDestructorINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEE3getEv:
  142|   210M|  const T* absl_nonnull get() const { return impl_.get(); }
_ZNK4absl12lts_2026081712NoDestructorINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEE13PlacementImpl3getEv:
  163|   210M|    const T* absl_nonnull get() const {
  164|   210M|      return std::launder(reinterpret_cast<const T*>(&space_));
  165|   210M|    }
_ZNK4absl12lts_2026081712NoDestructorINS0_13flat_hash_mapINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS8_8StringEqENS3_9allocatorINS3_4pairIKS7_hEEEEEEEptEv:
  141|   127M|  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|   127M|  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|   127M|    const T* absl_nonnull get() const {
  164|   127M|      return std::launder(reinterpret_cast<const T*>(&space_));
  165|   127M|    }
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|  7.49k|  T& operator*() { return *get(); }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSetEE3getEv:
  139|  7.49k|  T* absl_nonnull get() { return impl_.get(); }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSetEE13PlacementImpl3getEv:
  166|  7.49k|    T* absl_nonnull get() {
  167|  7.49k|      return std::launder(reinterpret_cast<T*>(&space_));
  168|  7.49k|    }

_ZN4absl12lts_2026081720PrefetchToLocalCacheEPKv:
  146|   864M|    const void* addr) {
  147|   864M|  __builtin_prefetch(addr, 0, 3);
  148|   864M|}
_ZN4absl12lts_2026081723PrefetchToLocalCacheNtaEPKv:
  151|   761k|    const void* addr) {
  152|   761k|  __builtin_prefetch(addr, 0, 0);
  153|   761k|}
_ZN4absl12lts_2026081728PrefetchToLocalCacheForWriteEPKv:
  156|   181M|    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|   181M|#if defined(__x86_64__) && !defined(__PRFCHW__)
  162|   181M|  asm("prefetchw %0" : : "m"(*reinterpret_cast<const char*>(addr)));
  163|       |#else
  164|       |  __builtin_prefetch(addr, 1, 3);
  165|       |#endif
  166|   181M|}

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

log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_EC2ESD_:
   49|  7.49k|  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|  7.49k|    ::new (GetCallbackBuffer()) Callback(std::move(callback));
   54|  7.49k|    is_callback_engaged_ = true;
   55|  7.49k|  }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E17GetCallbackBufferEv:
   72|  22.4k|  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|  7.49k|  bool IsCallbackEngaged() const { return is_callback_engaged_; }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E14InvokeCallbackEv:
   85|  7.49k|  void InvokeCallback() ABSL_NO_THREAD_SAFETY_ANALYSIS {
   86|  7.49k|    std::move(GetCallback())();
   87|  7.49k|  }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E11GetCallbackEv:
   74|  14.9k|  Callback& GetCallback() {
   75|  14.9k|    return *reinterpret_cast<Callback*>(GetCallbackBuffer());
   76|  14.9k|  }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E15DestroyCallbackEv:
   80|  7.49k|  void DestroyCallback() {
   81|  7.49k|    is_callback_engaged_ = false;
   82|  7.49k|    GetCallback().~Callback();
   83|  7.49k|  }

_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE4dataEv:
  210|  1.37k|  const_pointer data() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
  211|  1.37k|    return AsValueType(storage_.begin());
  212|  1.37k|  }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE11AsValueTypeEPS6_:
  428|  2.18k|  static pointer AsValueType(pointer ptr) { return ptr; }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage5beginEv:
  487|  44.2M|    StorageElement* begin() const { return data_; }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE4sizeEv:
  185|  1.37k|  size_type size() const { return storage_.size(); }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage4sizeEv:
  486|  44.2M|    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.37k|      : storage_(std::distance(first, last), a) {
  168|  1.37k|    memory_internal::CopyRange(storage_.alloc(), storage_.begin(), first, last);
  169|  1.37k|  }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7StorageC2EmRKS8_:
  476|  1.37k|        : size_alloc_(n, a), data_(InitializeData()) {}
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage14InitializeDataEv:
  502|  1.37k|    StorageElement* InitializeData() {
  503|  1.37k|      if (UsingInlinedStorage(size())) {
  ------------------
  |  Branch (503:11): [True: 567, False: 810]
  ------------------
  504|    567|        InlinedStorage::AnnotateConstruct(size());
  505|    567|        return InlinedStorage::data();
  506|    810|      } else {
  507|    810|        return reinterpret_cast<StorageElement*>(
  508|    810|            AllocatorTraits::allocate(alloc(), size()));
  509|    810|      }
  510|  1.37k|    }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage19UsingInlinedStorageEm:
  495|  2.75k|    static bool UsingInlinedStorage(size_type n) {
  496|  2.75k|      return n <= inline_elements;
  497|  2.75k|    }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE22NonEmptyInlinedStorage17AnnotateConstructEm:
  522|    567|    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|    567|  static_cast<void>(n);  // Mark used when not in asan mode
  531|    567|}
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE22NonEmptyInlinedStorage4dataEv:
  438|    567|    StorageElement* data() { return reinterpret_cast<StorageElement*>(buff_); }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage5allocEv:
  489|  44.2M|    allocator_type& alloc() { return size_alloc_.template get<1>(); }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7StorageD2Ev:
  478|  1.37k|    ~Storage() noexcept {
  479|  1.37k|      if (UsingInlinedStorage(size())) {
  ------------------
  |  Branch (479:11): [True: 567, False: 810]
  ------------------
  480|    567|        InlinedStorage::AnnotateDestruct(size());
  481|    810|      } else {
  482|    810|        AllocatorTraits::deallocate(alloc(), AsValueType(begin()), size());
  483|    810|      }
  484|  1.37k|    }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE22NonEmptyInlinedStorage16AnnotateDestructEm:
  535|    567|    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|    567|  static_cast<void>(n);  // Mark used when not in asan mode
  544|    567|}
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEED2Ev:
  171|  1.37k|  ~FixedArray() noexcept {
  172|  44.2M|    for (auto* cur = storage_.begin(); cur != storage_.end(); ++cur) {
  ------------------
  |  Branch (172:40): [True: 44.2M, False: 1.37k]
  ------------------
  173|  44.2M|      AllocatorTraits::destroy(storage_.alloc(), cur);
  174|  44.2M|    }
  175|  1.37k|  }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage3endEv:
  488|  44.2M|    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|   127M|  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|   234M|  apply(F&& f, Args&&... args) {
  690|   234M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|   234M|                                                   std::forward<Args>(args)...);
  692|   234M|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE7elementEPNS1_13map_slot_typeIS7_iEE:
  703|   428M|  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|  63.7M|  apply(F&& f, Args&&... args) {
  690|  63.7M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|  63.7M|                                                   std::forward<Args>(args)...);
  692|  63.7M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E5applyINS1_12EqualElementIS8_NS1_6HashEqIS8_vE2EqEEEJRNSt3__14pairIKS8_S9_EEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSM_DpOSN_:
  689|  35.1M|  apply(F&& f, Args&&... args) {
  690|  35.1M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|  35.1M|                                                   std::forward<Args>(args)...);
  692|  35.1M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E7elementEPNS1_13map_slot_typeIS8_S9_EE:
  703|   322M|  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|   200M|  apply(F&& f, Args&&... args) {
  690|   200M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|   200M|                                                   std::forward<Args>(args)...);
  692|   200M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E5applyINS1_11HashElementINS1_6HashEqIS8_vE4HashELb0EEEJRNSt3__14pairIKS8_S9_EEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSM_DpOSN_:
  689|   287M|  apply(F&& f, Args&&... args) {
  690|   287M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|   287M|                                                   std::forward<Args>(args)...);
  692|   287M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E8transferINSt3__19allocatorINSC_4pairIKS8_S9_EEEEEEDaPT_PNS1_13map_slot_typeIS8_S9_EESM_:
  682|   287M|                       slot_type* old_slot) {
  683|   287M|    return slot_policy::transfer(alloc, new_slot, old_slot);
  684|   287M|  }
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|   200M|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  671|   200M|    slot_policy::construct(alloc, slot, std::forward<Args>(args)...);
  672|   200M|  }
unigram_model.cc:_ZN4absl12lts_2026081713flat_hash_mapIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS5_NS0_18container_internal6HashEqIS7_vE4HashENSB_2EqENSt3__19allocatorINSE_4pairIKS7_S8_EEEEEC2Ev:
  205|  7.49k|  flat_hash_map() {}

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

_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE7elementIS9_EEDTclsrT_7elementfp_EEPNS1_13map_slot_typeIS8_hEE:
   85|   127M|      -> decltype(P::element(slot)) {
   86|   127M|    return P::element(slot);
   87|   127M|  }
_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|   428M|      -> decltype(P::element(slot)) {
   86|   428M|    return P::element(slot);
   87|   428M|  }
_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|   322M|      -> decltype(P::element(slot)) {
   86|   322M|    return P::element(slot);
   87|   322M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE8transferINSt3__19allocatorINSE_4pairIKS9_SA_EEEEEEvPT_PNS1_13map_slot_typeIS9_SA_EESO_:
   75|   287M|  static void transfer(Alloc* alloc, slot_type* new_slot, slot_type* old_slot) {
   76|   287M|    transfer_impl(alloc, new_slot, old_slot, Rank2{});
   77|   287M|  }
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|   287M|                                                           old_slot)) {
  120|   287M|    return P::transfer(alloc, new_slot, old_slot);
  121|   287M|  }
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|   200M|  static void construct(Alloc* alloc, slot_type* slot, Args&&... args) {
   52|   200M|    Policy::construct(alloc, slot, std::forward<Args>(args)...);
   53|   200M|  }

_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJmNSt3__19allocatorINS3_17basic_string_viewIcNS3_11char_traitsIcEEEEEEEE3getILi0EEERKNS1_25internal_compressed_tuple4ElemISA_XT_EE4typeEv:
  245|  44.2M|  constexpr const ElemT<I>& get() const& {
  246|  44.2M|    return StorageT<I>::get();
  247|  44.2M|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm0ENS2_10StorageTagIJmNSt3__19allocatorINS5_17basic_string_viewIcNS5_11char_traitsIcEEEEEEEEELb0EE3getEv:
   90|  44.2M|  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.37k|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|  1.37k|                                             std::forward<First>(first),
  237|  1.37k|                                             std::forward<Vs>(base)...) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJmNSt3__19allocatorINS5_17basic_string_viewIcNS5_11char_traitsIcEEEEEEEEENS5_16integer_sequenceImJLm0ELm1EEEELb1EEC2IJRmRKSB_EEENS5_10in_place_tEDpOT_:
  125|  2.75k|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|  2.75k|                                          std::forward<Vs>(args))... {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm0ENS2_10StorageTagIJmNSt3__19allocatorINS5_17basic_string_viewIcNS5_11char_traitsIcEEEEEEEEELb0EEC2IRmEENS5_10in_place_tEOT_:
   89|  1.37k|      : value(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorINS4_17basic_string_viewIcNS4_11char_traitsIcEEEEEELm1ENS2_10StorageTagIJmSA_EEELb1EEC2IRKSA_EENS4_10in_place_tEOT_:
  101|  1.37k|  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|  44.2M|  constexpr ElemT<I>& get() & {
  241|  44.2M|    return StorageT<I>::get();
  242|  44.2M|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorINS4_17basic_string_viewIcNS4_11char_traitsIcEEEEEELm1ENS2_10StorageTagIJmSA_EEELb1EE3getEv:
  104|  44.2M|  constexpr T& get() & { return *this; }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EE3getEv:
   90|  1.60G|  constexpr const T& get() const& { return value; }
_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi0EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  245|  1.60G|  constexpr const ElemT<I>& get() const& {
  246|  1.60G|    return StorageT<I>::get();
  247|  1.60G|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EE3getEv:
   91|  1.06G|  constexpr T& get() & { return value; }
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi0EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  240|  1.06G|  constexpr ElemT<I>& get() & {
  241|  1.06G|    return StorageT<I>::get();
  242|  1.06G|  }
_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|   298M|  constexpr const ElemT<I>& get() const& {
  246|   298M|    return StorageT<I>::get();
  247|   298M|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_8StringEqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashES4_NSt3__19allocatorIcEEEEELb1EE3getEv:
  103|   298M|  constexpr const T& get() const& { return *this; }
_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi1EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  245|   265M|  constexpr const ElemT<I>& get() const& {
  246|   265M|    return StorageT<I>::get();
  247|   265M|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EE3getEv:
  103|   265M|  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.89G|  constexpr const ElemT<I>& get() const& {
  246|  2.89G|    return StorageT<I>::get();
  247|  2.89G|  }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSD_2EqENSt3__19allocatorIcEEEEELb0EE3getEv:
   90|  2.89G|  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|  35.1M|  constexpr const ElemT<I>& get() const& {
  246|  35.1M|    return StorageT<I>::get();
  247|  35.1M|  }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE2EqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENSB_4HashESC_NSt3__19allocatorIcEEEEELb1EE3getEv:
  103|  35.1M|  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.88G|  constexpr ElemT<I>& get() & {
  241|  1.88G|    return StorageT<I>::get();
  242|  1.88G|  }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSD_2EqENSt3__19allocatorIcEEEEELb0EE3getEv:
   91|  1.88G|  constexpr T& get() & { return value; }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi1EEERKNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  245|   687M|  constexpr const ElemT<I>& get() const& {
  246|   687M|    return StorageT<I>::get();
  247|   687M|  }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELm1ENS2_10StorageTagIJNS1_12CommonFieldsESC_NSB_2EqENSt3__19allocatorIcEEEEELb1EE3getEv:
  103|   687M|  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|   487M|  constexpr ElemT<I>& get() & {
  241|   487M|    return StorageT<I>::get();
  242|   487M|  }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSG_2EqES6_EEELb1EE3getEv:
  104|   487M|  constexpr T& get() & { return *this; }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi1EEERNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  240|  14.9k|  constexpr ElemT<I>& get() & {
  241|  14.9k|    return StorageT<I>::get();
  242|  14.9k|  }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELm1ENS2_10StorageTagIJNS1_12CommonFieldsESC_NSB_2EqENSt3__19allocatorIcEEEEELb1EE3getEv:
  104|  14.9k|  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|  7.49k|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|  7.49k|                                             std::forward<First>(first),
  237|  7.49k|                                             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|  29.9k|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|  29.9k|                                          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|  7.49k|      : 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|  7.49k|  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|  7.49k|  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|  7.49k|  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|  14.9k|  constexpr const ElemT<I>& get() const& {
  246|  14.9k|    return StorageT<I>::get();
  247|  14.9k|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm1ENS2_10StorageTagIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEELb0EE3getEv:
   90|  14.9k|  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|  7.49k|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|  7.49k|                                             std::forward<First>(first),
  237|  7.49k|                                             std::forward<Vs>(base)...) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEENS5_16integer_sequenceImJLm0ELm1EEEELb1EEC2IJS9_jEEENS5_10in_place_tEDpOT_:
  125|  14.9k|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|  14.9k|                                          std::forward<Vs>(args))... {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIPNS0_7LogSinkEEELm0ENS2_10StorageTagIJS8_mEEELb1EEC2IS8_EENS4_10in_place_tEOT_:
  101|  7.49k|  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|  7.49k|      : value(std::forward<V>(v)) {}
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNSt3__19allocatorIPNS0_7LogSinkEEEmEE3getILi1EEERNS1_25internal_compressed_tuple4ElemIS8_XT_EE4typeEv:
  240|  7.49k|  constexpr ElemT<I>& get() & {
  241|  7.49k|    return StorageT<I>::get();
  242|  7.49k|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm1ENS2_10StorageTagIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEELb0EE3getEv:
   91|  7.49k|  constexpr T& get() & { return value; }

_ZN4absl12lts_2026081718container_internal27SanitizerPoisonMemoryRegionEPKvm:
  236|   287M|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|   287M|  (void)m;
  244|   287M|  (void)s;
  245|   287M|}
_ZN4absl12lts_2026081718container_internal29SanitizerUnpoisonMemoryRegionEPKvm:
  247|   487M|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|   487M|  (void)m;
  255|   487M|  (void)s;
  256|   487M|}
_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|  63.7M|    const std::pair<F, S>& p) {
  204|  63.7M|  return PairArgs(p.first, p.second);
  205|  63.7M|}
_ZN4absl12lts_2026081718container_internal8PairArgsIRKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEERKhEENS3_4pairINS3_5tupleIJOT_EEENSD_IJOT0_EEEEESF_SI_:
  197|  63.7M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|  63.7M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|  63.7M|          std::forward_as_tuple(std::forward<S>(s))};
  200|  63.7M|}
_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|   265M|  HashElement(const Hash& h, size_t s) : hash(h), seed(s) {}
_ZNK4absl12lts_2026081718container_internal11HashElementINS1_10StringHashELb1EEclINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJEEEmRKT_DpOT0_:
  494|   265M|  size_t operator()(const K& key, Args&&...) const {
  495|   265M|    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|   265M|      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  500|   265M|    }
  501|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  502|      0|    return hash(key) ^ seed;
  503|   265M|  }
_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|   234M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|   234M|  return memory_internal::DecomposePairImpl(
  224|   234M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|   234M|}
_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|   234M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|   234M|  const auto& key = std::get<0>(p.first);
  158|   234M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|   234M|                            std::move(p.second));
  160|   234M|}
_ZNK4absl12lts_2026081718container_internal12EqualElementINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEENS1_8StringEqEEclIS7_JRKNS3_21piecewise_construct_tENS3_5tupleIJRKS7_EEENSE_IJRKiEEEEEEbRKT_DpOT0_:
  525|   234M|  bool operator()(const K2& lhs, Args&&...) const {
  526|   234M|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|   234M|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|   234M|  }
_ZN4absl12lts_2026081718container_internal8PairArgsIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiEENS3_4pairINS3_5tupleIJRKT_EEENSA_IJRKT0_EEEEERKNS9_ISB_SF_EE:
  203|   234M|    const std::pair<F, S>& p) {
  204|   234M|  return PairArgs(p.first, p.second);
  205|   234M|}
_ZN4absl12lts_2026081718container_internal8PairArgsIRKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEERKiEENS3_4pairINS3_5tupleIJOT_EEENSD_IJOT0_EEEEESF_SI_:
  197|   234M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|   234M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|   234M|          std::forward_as_tuple(std::forward<S>(s))};
  200|   234M|}
_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|  63.7M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|  63.7M|  return memory_internal::DecomposePairImpl(
  224|  63.7M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|  63.7M|}
_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|  63.7M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|  63.7M|  const auto& key = std::get<0>(p.first);
  158|  63.7M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|  63.7M|                            std::move(p.second));
  160|  63.7M|}
_ZNK4absl12lts_2026081718container_internal12EqualElementINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEENS1_8StringEqEEclIS7_JRKNS3_21piecewise_construct_tENS3_5tupleIJRKS7_EEENSE_IJRKhEEEEEEbRKT_DpOT0_:
  525|  63.7M|  bool operator()(const K2& lhs, Args&&...) const {
  526|  63.7M|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|  63.7M|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|  63.7M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12EqualElementIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisENS1_6HashEqIS9_vE2EqEEEJRNSt3__14pairIKS9_PS7_EEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSK_DpOSL_:
  222|  35.1M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|  35.1M|  return memory_internal::DecomposePairImpl(
  224|  35.1M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|  35.1M|}
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|  35.1M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|  35.1M|  const auto& key = std::get<0>(p.first);
  158|  35.1M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|  35.1M|                            std::move(p.second));
  160|  35.1M|}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12EqualElementIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisENS1_6HashEqIS8_vE2EqEEclIS8_JRKNSt3__121piecewise_construct_tENSE_5tupleIJRKS8_EEENSI_IJRKPS6_EEEEEEbRKT_DpOT0_:
  525|  35.1M|  bool operator()(const K2& lhs, Args&&...) const {
  526|  35.1M|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|  35.1M|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|  35.1M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIKPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EENSt3__14pairINSB_5tupleIJRKT_EEENSD_IJRKT0_EEEEERKNSC_ISE_SI_EE:
  203|   322M|    const std::pair<F, S>& p) {
  204|   322M|  return PairArgs(p.first, p.second);
  205|   322M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIRKPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisERKPS6_EENSt3__14pairINSE_5tupleIJOT_EEENSG_IJOT0_EEEEESI_SL_:
  197|   322M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|   322M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|   322M|          std::forward_as_tuple(std::forward<S>(s))};
  200|   322M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEC2ERKSB_m:
  491|   687M|  HashElement(const Hash& h, size_t s) : hash(h), seed(s) {}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEclIS9_JEEEmRKT_DpOT0_:
  494|   400M|  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|   400M|    return hash(key) ^ seed;
  503|   400M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS8_EEJEE19EmplaceDecomposableEJNSt3__14pairISA_SB_EEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSI_DpOSJ_:
  222|   200M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|   200M|  return memory_internal::DecomposePairImpl(
  224|   200M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|   200M|}
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|   200M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|   200M|  const auto& key = std::get<0>(p.first);
  158|   200M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|   200M|                            std::move(p.second));
  160|   200M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal23TypeErasedApplyToSlotFnINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashES9_Lb0EEEmPKvPvm:
  538|  7.49k|size_t TypeErasedApplyToSlotFn(const void* fn, void* slot, size_t seed) {
  539|  7.49k|  const auto* f = static_cast<const Fn*>(fn);
  540|  7.49k|  return HashElement<Fn, kIsDefault>{*f, seed}(*static_cast<const T*>(slot));
  541|  7.49k|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEEJRNSt3__14pairIKSA_PS8_EEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSK_DpOSL_:
  222|   287M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|   287M|  return memory_internal::DecomposePairImpl(
  224|   287M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|   287M|}
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|   287M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|   287M|  const auto& key = std::get<0>(p.first);
  158|   287M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|   287M|                            std::move(p.second));
  160|   287M|}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEclIS9_JRKNSt3__121piecewise_construct_tENSE_5tupleIJRKS9_EEENSI_IJRKPS7_EEEEEEmRKT_DpOT0_:
  494|   287M|  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|   287M|    return hash(key) ^ seed;
  503|   287M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15map_slot_policyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E8transferINSt3__19allocatorINSC_4pairIKS8_S9_EEEEEEDaPT_PNS1_13map_slot_typeIS8_S9_EESM_:
  438|   287M|                       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|   287M|    auto is_relocatable = typename std::conjunction<
  445|   287M|        absl::is_trivially_relocatable<typename value_type::first_type>,
  446|   287M|        absl::is_trivially_relocatable<typename value_type::second_type>>::
  447|   287M|        type();
  448|       |
  449|   287M|    emplace(new_slot);
  450|   287M|    if (is_relocatable) {
  ------------------
  |  Branch (450:9): [True: 287M, Folded]
  ------------------
  451|       |      // TODO(b/247130232,b/251814870): remove casts after fixing warnings.
  452|   287M|      std::memcpy(static_cast<void*>(std::launder(&new_slot->value)),
  453|   287M|                  static_cast<const void*>(&old_slot->value),
  454|   287M|                  sizeof(value_type));
  455|   287M|      return is_relocatable;
  456|   287M|    }
  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|   287M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15map_slot_policyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E7emplaceEPNS1_13map_slot_typeIS8_S9_EE:
  364|   487M|  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|   487M|    new (slot) slot_type;
  368|   487M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13map_slot_typeIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EC2Ev:
  345|   487M|  map_slot_type() {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal7HashKeyINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashES9_Lb0EEC2ERKSB_RKS9_:
  511|  14.9k|  HashKey(const Hash& h, const Key& k) : hash(h), key(k) {}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal7HashKeyINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashES9_Lb0EEclEm:
  513|  7.49k|  size_t operator()(size_t seed) const {
  514|  7.49k|    return HashElement<Hash, kIsDefault>{hash, seed}(key);
  515|  7.49k|  }
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|   200M|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  394|   200M|    emplace(slot);
  395|   200M|    if (kMutableKeys::value) {
  ------------------
  |  Branch (395:9): [True: 200M, Folded]
  ------------------
  396|   200M|      std::allocator_traits<Allocator>::construct(*alloc, &slot->mutable_value,
  397|   200M|                                                  std::forward<Args>(args)...);
  398|   200M|    } else {
  399|      0|      std::allocator_traits<Allocator>::construct(*alloc, &slot->value,
  400|      0|                                                  std::forward<Args>(args)...);
  401|      0|    }
  402|   200M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EENSt3__14pairINSA_5tupleIJOT_EEENSC_IJOT0_EEEEEONSB_ISD_SG_EE:
  207|   200M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(std::pair<F, S>&& p) {
  208|   200M|  return PairArgs(std::forward<F>(p.first), std::forward<S>(p.second));
  209|   200M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EENSt3__14pairINSA_5tupleIJOT_EEENSC_IJOT0_EEEEESE_SH_:
  197|   200M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|   200M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|   200M|          std::forward_as_tuple(std::forward<S>(s))};
  200|   200M|}
_ZN4absl12lts_2026081718container_internal8AllocateILm8ENSt3__19allocatorIcEEEEPvPT0_m:
   62|   109k|void* Allocate(Alloc* alloc, size_t n) {
   63|   109k|  static_assert(Alignment > 0, "");
   64|   109k|  assert(n && "n must be positive");
   65|   109k|  using M = AlignedType<Alignment>;
   66|   109k|  using A = typename std::allocator_traits<Alloc>::template rebind_alloc<M>;
   67|   109k|  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|   109k|  A my_mem_alloc(*alloc);
   72|   109k|  void* p = AT::allocate(my_mem_alloc, (n + sizeof(M) - 1) / sizeof(M));
   73|       |  assert(reinterpret_cast<uintptr_t>(p) % Alignment == 0 &&
   74|   109k|         "allocator does not respect alignment");
   75|   109k|  return p;
   76|   109k|}
_ZN4absl12lts_2026081718container_internal10DeallocateILm8ENSt3__19allocatorIcEEEEvPT0_Pvm:
   93|   109k|void Deallocate(Alloc* alloc, void* p, size_t n) {
   94|   109k|  static_assert(Alignment > 0, "");
   95|   109k|  assert(n && "n must be positive");
   96|   109k|  using M = AlignedType<Alignment>;
   97|   109k|  using A = typename std::allocator_traits<Alloc>::template rebind_alloc<M>;
   98|   109k|  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|   109k|  A my_mem_alloc(*alloc);
  103|   109k|  AT::deallocate(my_mem_alloc, static_cast<M*>(p),
  104|   109k|                 (n + sizeof(M) - 1) / sizeof(M));
  105|   109k|}

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

_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|   234M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|   234M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|   234M|  }
_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|  63.7M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|  63.7M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|  63.7M|  }
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|  35.1M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|  35.1M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|  35.1M|  }
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|   200M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|   200M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|   200M|  }
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|   287M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|   287M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|   287M|  }

_ZN4absl12lts_2026081718container_internal13GroupSse2ImplC2EPKNS1_6ctrl_tE:
  286|   748M|  explicit GroupSse2Impl(const ctrl_t* pos) {
  287|   748M|    ctrl = _mm_loadu_si128(reinterpret_cast<const __m128i*>(pos));
  288|   748M|  }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl5MatchEh:
  291|   713M|  BitMaskType Match(h2_t hash) const {
  292|   713M|    auto match = _mm_set1_epi8(static_cast<char>(hash));
  293|   713M|    return BitMaskType(MoveMask(_mm_cmpeq_epi8(match, ctrl)));
  294|   713M|  }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl9MaskEmptyEv:
  297|   455M|  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|   455M|    auto match = _mm_set1_epi8(static_cast<char>(ctrl_t::kEmpty));
  303|   455M|    return NonIterableBitMaskType(MoveMask(_mm_cmpeq_epi8(match, ctrl)));
  304|   455M|#endif
  305|   455M|  }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl8MaskFullEv:
  310|  20.5M|  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.20G|  static MaskInt MoveMask(__m128i xmm) {
  347|  1.20G|    auto mask = static_cast<MaskInt>(_mm_movemask_epi8(xmm));
  348|  1.20G|#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.20G|    asm("" : "+r"(mask));  // NOLINT
  353|  1.20G|#endif
  354|  1.20G|    return mask;
  355|  1.20G|  }
_ZN4absl12lts_2026081718container_internal7IsEmptyENS1_6ctrl_tE:
  222|  1.54M|inline bool IsEmpty(ctrl_t c) { return c == ctrl_t::kEmpty; }
_ZN4absl12lts_2026081718container_internal6IsFullENS1_6ctrl_tE:
  223|   200M|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|   200M|  return static_cast<std::underlying_type_t<ctrl_t>>(c) >= 0;
  228|   200M|}
_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|   117k|uint32_t TrailingZeros(T x) {
   64|   117k|  ABSL_ASSUME(x != 0);
  ------------------
  |  |  272|   117k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
   65|   117k|  return static_cast<uint32_t>(countr_zero(x));
   66|   117k|}
_ZN4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EEC2Ej:
  133|  1.48G|  explicit BitMask(T mask) : Base(mask) {
  134|  1.48G|    if (Shift == 3 && !NullifyBitsOnIteration) {
  ------------------
  |  Branch (134:9): [Folded, False: 1.48G]
  |  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.48G|  }
_ZN4absl12lts_2026081718container_internal18NonIterableBitMaskIjLi16ELi0EEC2Ej:
   85|  1.93G|  explicit NonIterableBitMask(T mask) : mask_(mask) {}
_ZNK4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EE5beginEv:
  153|   733M|  BitMask begin() const { return *this; }
_ZNK4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EE3endEv:
  154|   733M|  BitMask end() const { return BitMask(0); }
_ZN4absl12lts_2026081718container_internalneERKNS1_7BitMaskIjLi16ELi0ELb0EEES5_:
  160|  1.09G|  friend bool operator!=(const BitMask& a, const BitMask& b) {
  161|  1.09G|    return a.mask_ != b.mask_;
  162|  1.09G|  }
_ZNK4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EEdeEv:
  151|   620M|  uint32_t operator*() const { return Base::LowestBitSet(); }
_ZNK4absl12lts_2026081718container_internal18NonIterableBitMaskIjLi16ELi0EE12LowestBitSetEv:
   90|   833M|  uint32_t LowestBitSet() const {
   91|   833M|    return container_internal::TrailingZeros(mask_) >> Shift;
   92|   833M|  }
_ZN4absl12lts_2026081718container_internal13TrailingZerosIjEEjT_:
   63|   833M|uint32_t TrailingZeros(T x) {
   64|   833M|  ABSL_ASSUME(x != 0);
  ------------------
  |  |  272|   833M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
   65|   833M|  return static_cast<uint32_t>(countr_zero(x));
   66|   833M|}
_ZNK4absl12lts_2026081718container_internal18NonIterableBitMaskIjLi16ELi0EEcvbEv:
   87|   469M|  explicit operator bool() const { return mask_ != 0; }
_ZN4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EEppEv:
  143|   362M|  BitMask& operator++() {
  144|   362M|    if (Shift == 3 && NullifyBitsOnIteration) {
  ------------------
  |  Branch (144:9): [Folded, False: 362M]
  |  Branch (144:23): [Folded, False: 0]
  ------------------
  145|      0|      this->mask_ &= kMsbs8Bytes;
  146|      0|    }
  147|   362M|    this->mask_ &= (this->mask_ - 1);
  148|   362M|    return *this;
  149|   362M|  }

_ZN4absl12lts_2026081718container_internal20HashtablezInfoHandle10UnregisterEv:
  203|  7.49k|  inline void Unregister() {}
_ZNK4absl12lts_2026081718container_internal20HashtablezInfoHandle9IsSampledEv:
  204|   109k|  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|   200M|                               size_t /*distance_from_desired*/) {}
_ZN4absl12lts_2026081718container_internal21ShouldSampleNextTableEv:
  226|  7.50k|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|  7.50k|  return false;
  234|  7.50k|#endif  // ABSL_INTERNAL_HASHTABLEZ_SAMPLE
  235|  7.50k|}

_ZNK4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE14GetIsAllocatedEv:
  372|  7.49k|  bool GetIsAllocated() const { return GetSizeAndIsAllocated() & 1; }
_ZNK4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE21GetSizeAndIsAllocatedEv:
  366|  14.9k|  const SizeType<A>& GetSizeAndIsAllocated() const {
  367|  14.9k|    return metadata_.template get<1>();
  368|  14.9k|  }
_ZN4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE14GetInlinedDataEv:
  396|  7.49k|  ABSL_ATTRIBUTE_NO_SANITIZE_CFI Pointer<A> GetInlinedData() {
  397|  7.49k|    return reinterpret_cast<Pointer<A>>(data_.inlined.inlined_data);
  398|  7.49k|  }
_ZNK4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE7GetSizeEv:
  370|  7.49k|  SizeType<A> GetSize() const { return GetSizeAndIsAllocated() >> 1; }
_ZN4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEEC2Ev:
  337|  7.49k|  Storage() : metadata_(A(), /* size and is_allocated */ 0u) {}
_ZN4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEED2Ev:
  342|  7.49k|  ~Storage() {
  343|       |    // Fast path: if we are empty and not allocated, there's nothing to do.
  344|  7.49k|    if (GetSizeAndIsAllocated() == 0) {
  ------------------
  |  Branch (344:9): [True: 7.49k, False: 0]
  ------------------
  345|  7.49k|      return;
  346|  7.49k|    }
  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|  7.49k|  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|  17.0k|  static constexpr PartialType<sizeof...(Sizes)> Partial(Sizes&&... sizes) {
  742|  17.0k|    static_assert(sizeof...(Sizes) + StaticSizeSeq::size() <= sizeof...(Ts),
  743|  17.0k|                  "");
  744|  17.0k|    return PartialType<sizeof...(Sizes)>(
  745|  17.0k|        static_cast<size_t>(std::forward<Sizes>(sizes))...);
  746|  17.0k|  }
_ZN4absl12lts_2026081718container_internal15internal_layout10LayoutImplINSt3__15tupleIJN6google8protobuf8internal22SerialArenaChunkHeaderENS4_6atomicIPvEENSA_IPNS8_11SerialArenaEEEEEENS4_16integer_sequenceImJLm1EEEENSH_ImJEEENSH_ImJLm0EEEENSH_ImJLm0ELm1EEEEEC2Ev:
  401|  17.0k|      : size_{sizes...} {}
_ZNK4absl12lts_2026081718container_internal15internal_layout10LayoutImplINSt3__15tupleIJN6google8protobuf8internal22SerialArenaChunkHeaderENS4_6atomicIPvEENSA_IPNS8_11SerialArenaEEEEEENS4_16integer_sequenceImJLm1EEEENSH_ImJEEENSH_ImJLm0EEEENSH_ImJLm0ELm1EEEEE6OffsetILm0EEEmv:
  418|  17.0k|  constexpr size_t Offset() const {
  419|  17.0k|    if constexpr (N == 0) {
  420|  17.0k|      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|  17.0k|  }
_ZNK4absl12lts_2026081718container_internal15internal_layout10LayoutImplINSt3__15tupleIJN6google8protobuf8internal22SerialArenaChunkHeaderENS4_6atomicIPvEENSA_IPNS8_11SerialArenaEEEEEENS4_16integer_sequenceImJLm1EEEENSH_ImJEEENSH_ImJLm0EEEENSH_ImJLm0ELm1EEEEE7PointerILm0EKcEEPNS4_11conditionalIXsr3stdE10is_const_vIT0_EEKNS4_13tuple_elementIXT_ESG_E4typeEST_E4typeEPSQ_:
  496|  17.0k|  CopyConst<Char, ElementType<N>>* Pointer(Char* p) const {
  497|  17.0k|    using C = std::remove_const_t<Char>;
  498|  17.0k|    static_assert(
  499|  17.0k|        std::is_same<C, char>() || std::is_same<C, unsigned char>() ||
  500|  17.0k|            std::is_same<C, signed char>(),
  501|  17.0k|        "The argument must be a pointer to [const] [signed|unsigned] char");
  502|  17.0k|    constexpr size_t alignment = Alignment();
  503|  17.0k|    (void)alignment;
  504|       |    assert(reinterpret_cast<uintptr_t>(p) % alignment == 0);
  505|  17.0k|    return reinterpret_cast<CopyConst<Char, ElementType<N>>*>(p + Offset<N>());
  506|  17.0k|  }

_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|  7.49k|  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|  7.50k|uint8_t NextHashTableSeed() {
  145|  7.50k|  return static_cast<uint8_t>(RandomSeed());
  146|  7.50k|}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor23InitGrowthLeftNoDeletedEmm:
  361|   102k|                                                 size_t capacity) {
  362|   102k|  if (capacity <= GrowthInfoLowerBound::kMaxGrowthLeftLowerBound) {
  ------------------
  |  Branch (362:7): [True: 45.0k, False: 57.2k]
  ------------------
  363|  45.0k|    *growth_info_lower_bound_ = static_cast<uint8_t>(growth_left);
  364|  57.2k|  } else {
  365|  57.2k|    uint64_t lower_bound =
  366|  57.2k|        (std::min)(uint64_t{growth_left},
  367|  57.2k|                   GrowthInfoLowerBound::kMaxGrowthLeftLowerBound);
  368|  57.2k|    little_endian::Store64(
  369|  57.2k|        full_growth_info_ptr(),
  370|  57.2k|        GetPackedIncrement(lower_bound, growth_left - lower_bound));
  371|  57.2k|  }
  372|   102k|}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor29RebalanceGrowthLeftLowerBoundEm:
  375|  1.63M|    size_t capacity) {
  376|  1.63M|  auto growth_left_lower_bound = GetGrowthInfoLowerBound();
  377|  1.63M|  if (capacity <= GrowthInfoLowerBound::kMaxGrowthLeftLowerBound ||
  ------------------
  |  Branch (377:7): [True: 45.0k, False: 1.59M]
  ------------------
  378|       |      // For tables with deleted slots, we often call rebalance even if
  379|       |      // we have growth left in the lower bound.
  380|  1.59M|      growth_left_lower_bound.HasDeletedAndGrowthLeft()) {
  ------------------
  |  Branch (380:7): [True: 0, False: 1.59M]
  ------------------
  381|  45.0k|    return growth_left_lower_bound;
  382|  1.59M|  } else {
  383|  1.59M|    return RebalanceGrowthLeftLowerBoundLargeCapacity();
  384|  1.59M|  }
  385|  1.63M|}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor42RebalanceGrowthLeftLowerBoundLargeCapacityEv:
  397|  1.59M|GrowthInfoAccessor::RebalanceGrowthLeftLowerBoundLargeCapacity() {
  398|  1.59M|  void* full_growth_info = full_growth_info_ptr();
  399|  1.59M|  uint64_t packed_full_growth_info = little_endian::Load64(full_growth_info);
  400|  1.59M|  uint64_t overflow_growth_left =
  401|  1.59M|      GetOverflowGrowthLeftFromPacked(packed_full_growth_info);
  402|  1.59M|  uint64_t lower_bound_growth_left =
  403|  1.59M|      GetGrowthLeftLowerBoundFromPacked(packed_full_growth_info);
  404|  1.59M|  uint64_t overflow_to_lower_bound_size =
  405|  1.59M|      (std::min)(overflow_growth_left,
  406|  1.59M|                 GrowthInfoLowerBound::kMaxGrowthLeftLowerBound -
  407|  1.59M|                     lower_bound_growth_left);
  408|  1.59M|  packed_full_growth_info +=
  409|  1.59M|      GetRebalanceIncrement(overflow_to_lower_bound_size);
  410|  1.59M|  little_endian::Store64(full_growth_info, packed_full_growth_info);
  411|  1.59M|  auto result = GetGrowthInfoLowerBoundFromPacked(packed_full_growth_info);
  412|  1.59M|  ABSL_SWISSTABLE_ASSERT(result.HasNoDeleted() ==
  ------------------
  |  |   66|  1.59M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  413|  1.59M|                         GetGrowthInfoLowerBound().HasNoDeleted());
  414|       |  ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |   66|  1.59M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  415|  1.59M|      (result.GetGrowthLeft() > 0 ||
  416|  1.59M|       GetGrowthLeftTotalBigCapacity(full_growth_info_ptr()) == 0) &&
  417|  1.59M|      "rebalance may return 0 only if we have absolutely no growth left");
  418|  1.59M|  return result;
  419|  1.59M|}
_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|  7.49k|                         DeallocBackingArrayFn dealloc, void* alloc) {
  921|  7.49k|  const size_t cap = c.capacity();
  922|  7.49k|  c.infoz().Unregister();
  923|  7.49k|  dealloc(alloc, cap, c.control(), slot_size, slot_align, c.has_infoz(),
  924|  7.49k|          c.blocked_element_count());
  925|  7.49k|}
_ZN4absl12lts_2026081718container_internal14DestructNonSooERNS1_12CommonFieldsEmmPFvPvS4_EPFvS4_mPNS1_6ctrl_tEmmbmES4_:
  981|  7.49k|                    void* alloc) {
  982|  7.49k|  ABSL_SWISSTABLE_ASSERT(c.capacity() > 0);
  ------------------
  |  |   66|  7.49k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  983|  7.49k|  if (destroy_slot != nullptr) {
  ------------------
  |  Branch (983:7): [True: 0, False: 7.49k]
  ------------------
  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|  7.49k|  DeallocBackingArray(c, slot_size, slot_align, dealloc, alloc);
  994|  7.49k|}
_ZN4absl12lts_2026081718container_internal24PrepareInsertSmallNonSooERNS1_12CommonFieldsERKNS1_15PolicyFunctionsENS0_11FunctionRefIFmmEEE:
 1855|  15.0k|                               absl::FunctionRef<size_t(size_t)> get_hash) {
 1856|  15.0k|  ABSL_SWISSTABLE_ASSERT(common.is_small());
  ------------------
  |  |   66|  15.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1857|  15.0k|  ABSL_SWISSTABLE_ASSERT(!policy.soo_enabled);
  ------------------
  |  |   66|  15.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1858|  15.0k|  if (common.capacity() == 1) {
  ------------------
  |  Branch (1858:7): [True: 7.50k, False: 7.50k]
  ------------------
 1859|  7.50k|    if (common.empty()) {
  ------------------
  |  Branch (1859:9): [True: 0, False: 7.50k]
  ------------------
 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|  7.50k|    } else {
 1867|  7.50k|      return Grow1To3AndPrepareInsert(common, policy, get_hash);
 1868|  7.50k|    }
 1869|  7.50k|  }
 1870|       |
 1871|       |  // Growing from 0 to 1 capacity.
 1872|  7.50k|  ABSL_SWISSTABLE_ASSERT(common.capacity() == 0);
  ------------------
  |  |   66|  7.50k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1873|  7.50k|  constexpr size_t kNewCapacity = 1;
 1874|       |
 1875|  7.50k|  common.set_capacity(kNewCapacity);
 1876|  7.50k|  HashtablezInfoHandle infoz;
 1877|  7.50k|  const bool should_sample =
 1878|  7.50k|      policy.is_hashtablez_eligible && ShouldSampleNextTable();
  ------------------
  |  Branch (1878:7): [True: 7.50k, False: 0]
  |  Branch (1878:40): [True: 0, False: 7.50k]
  ------------------
 1879|  7.50k|  if (ABSL_PREDICT_FALSE(should_sample)) {
  ------------------
  |  |  190|  7.50k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7.50k]
  |  |  |  Branch (190:49): [Folded, False: 7.50k]
  |  |  |  Branch (190:58): [True: 0, False: 7.50k]
  |  |  ------------------
  ------------------
 1880|      0|    infoz = ForcedTrySample(policy.slot_size, policy.key_size,
 1881|      0|                            policy.value_size, policy.soo_capacity());
 1882|      0|  }
 1883|  7.50k|  const bool has_infoz = infoz.IsSampled();
 1884|  7.50k|  void* alloc = policy.get_char_alloc(common);
 1885|       |
 1886|  7.50k|  const auto [new_ctrl, new_slots] =
 1887|  7.50k|      AllocBackingArray(common, policy, kNewCapacity, has_infoz, alloc,
 1888|  7.50k|                        /*blocked_element_count=*/0);
 1889|  7.50k|  common.set_control(new_ctrl);
 1890|       |
 1891|  7.50k|  static_assert(NextCapacity(0) == 1);
 1892|  7.50k|  PrepareInsertCommon(common);
 1893|       |
 1894|  7.50k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  7.50k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7.50k]
  |  |  |  Branch (190:49): [Folded, False: 7.50k]
  |  |  |  Branch (190:58): [True: 0, False: 7.50k]
  |  |  ------------------
  ------------------
 1895|      0|    common.generate_new_seed(/*has_infoz=*/true);
 1896|      0|    ReportSingleGroupTableGrowthToInfoz(common, infoz,
 1897|      0|                                        get_hash(common.seed().seed()));
 1898|      0|  }
 1899|  7.50k|  return new_slots;
 1900|  15.0k|}
_ZN4absl12lts_2026081718container_internal19GetRefForEmptyClassERNS1_12CommonFieldsE:
 2096|   117k|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|   117k|  return &common;
 2102|   117k|}
_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|   200M|                         FindInfo target_group) {
 2401|       |  // NOLINTNEXTLINE(misc-static-assert)
 2402|       |  ABSL_SWISSTABLE_ASSERT(!SwisstableGenerationsEnabled());
  ------------------
  |  |   66|   200M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2403|   200M|  return PrepareInsertLargeImpl(common, policy, hash, mask_empty, target_group);
 2404|   200M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119Resize1To3NewOffsetEmNS1_12PerTableSeedE:
  113|  7.50k|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|  7.50k|  static_assert(SooSlotIndex() == 1);
  117|  7.50k|  return SingleGroupTableH1(hash, seed) & 2;
  118|  7.50k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118SingleGroupTableH1EmNS1_12PerTableSeedE:
  108|  22.5k|size_t SingleGroupTableH1(size_t hash, PerTableSeed seed) {
  109|  22.5k|  return hash ^ seed.seed();
  110|  22.5k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_111SlotAddressEPvmm:
  122|   200M|inline void* SlotAddress(void* slot_array, size_t slot, size_t slot_size) {
  123|   200M|  return static_cast<void*>(static_cast<char*>(slot_array) +
  124|   200M|                            (slot * slot_size));
  125|   200M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_110RandomSeedEv:
   81|  7.50k|inline size_t RandomSeed() {
   82|  7.50k|  constexpr size_t kIncrement = 0xad53;
   83|  7.50k|#ifdef ABSL_HAVE_THREAD_LOCAL
   84|  7.50k|  static thread_local size_t counter = 0;
   85|  7.50k|  counter += kIncrement;
   86|  7.50k|  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|  7.50k|  return value ^ static_cast<size_t>(reinterpret_cast<uintptr_t>(&counter));
   92|  7.50k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GetPackedIncrementEmm:
  292|  1.64M|                                      uint64_t overflow_increment) {
  293|  1.64M|  return (lower_bound_increment << GrowthInfoAccessor::kLowerBoundShift) +
  294|  1.64M|         overflow_increment;
  295|  1.64M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_131GetOverflowGrowthLeftFromPackedEm:
  308|  1.59M|    uint64_t packed_full_growth_info) {
  309|  1.59M|  constexpr uint64_t kFullGrowthMask =
  310|  1.59M|      (uint64_t{1} << GrowthInfoAccessor::kLowerBoundShift) - 1;
  311|  1.59M|  return packed_full_growth_info & kFullGrowthMask;
  312|  1.59M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_133GetGrowthLeftLowerBoundFromPackedEm:
  324|  1.59M|    uint64_t packed_full_growth_info) {
  325|  1.59M|  return GetGrowthInfoLowerBoundFromPacked(packed_full_growth_info)
  326|  1.59M|      .GetGrowthLeft();
  327|  1.59M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_121GetRebalanceIncrementEm:
  301|  1.59M|    uint64_t overflow_to_lower_bound_size) {
  302|  1.59M|  return GetPackedIncrement(overflow_to_lower_bound_size,
  303|  1.59M|                            0u - overflow_to_lower_bound_size);
  304|  1.59M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_133GetGrowthInfoLowerBoundFromPackedEm:
  317|  3.18M|    uint64_t packed_full_growth_info) {
  318|  3.18M|  return GrowthInfoLowerBound(packed_full_growth_info >>
  319|  3.18M|                              GrowthInfoAccessor::kLowerBoundShift);
  320|  3.18M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119PrepareInsertCommonERNS1_12CommonFieldsE:
  500|   200M|void PrepareInsertCommon(CommonFields& common) {
  501|   200M|  common.increment_size();
  502|   200M|  common.maybe_increment_generation_on_insert();
  503|   200M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_135InitializeThreeElementsControlBytesEhhmPNS1_6ctrl_tE:
  759|  7.50k|    h2_t orig_h2, h2_t new_h2, size_t new_offset, ctrl_t* new_ctrl) {
  760|  7.50k|  static constexpr size_t kNewCapacity = NextCapacity(SooCapacity());
  761|  7.50k|  static_assert(kNewCapacity == 3);
  762|  7.50k|  static_assert(is_single_group(kNewCapacity));
  763|  7.50k|  static_assert(SooSlotIndex() == 1);
  764|  7.50k|  ABSL_SWISSTABLE_ASSERT(new_offset == 0 || new_offset == 2);
  ------------------
  |  |   66|  7.50k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  765|       |
  766|  7.50k|  static constexpr uint64_t kEmptyXorSentinel =
  767|  7.50k|      static_cast<uint8_t>(ctrl_t::kEmpty) ^
  768|  7.50k|      static_cast<uint8_t>(ctrl_t::kSentinel);
  769|  7.50k|  static constexpr uint64_t kEmpty64 = static_cast<uint8_t>(ctrl_t::kEmpty);
  770|  7.50k|  static constexpr size_t kMirroredSooSlotIndex =
  771|  7.50k|      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|  7.50k|  static constexpr uint64_t kFirstCtrlBytesWithZeroes =
  776|  7.50k|      k8EmptyBytes ^ (kEmpty64 << (8 * SooSlotIndex())) ^
  777|  7.50k|      (kEmptyXorSentinel << (8 * kNewCapacity)) ^
  778|  7.50k|      (kEmpty64 << (8 * kMirroredSooSlotIndex));
  779|       |
  780|  7.50k|  const uint64_t soo_h2 = static_cast<uint64_t>(orig_h2);
  781|  7.50k|  const uint64_t new_h2_xor_empty =
  782|  7.50k|      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|  7.50k|  uint64_t first_ctrl_bytes =
  788|  7.50k|      ((soo_h2 << (8 * SooSlotIndex())) | kFirstCtrlBytesWithZeroes) |
  789|  7.50k|      (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|  7.50k|  first_ctrl_bytes ^= (new_h2_xor_empty << (8 * new_offset));
  797|  7.50k|  size_t new_mirrored_offset = new_offset + kNewCapacity + 1;
  798|  7.50k|  first_ctrl_bytes ^= (new_h2_xor_empty << (8 * new_mirrored_offset));
  799|       |
  800|       |  // Fill last bytes with kEmpty.
  801|  7.50k|  std::memset(new_ctrl + kNewCapacity, static_cast<int8_t>(ctrl_t::kEmpty),
  802|  7.50k|              Group::kWidth);
  803|       |  // Overwrite the first 8 bytes with first_ctrl_bytes.
  804|  7.50k|  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|  7.50k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_17SetCtrlERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  532|   198M|                    size_t slot_size) {
  533|       |  ABSL_SWISSTABLE_ASSERT(!c.is_small());
  ------------------
  |  |   66|   198M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  534|   198M|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  535|   198M|  SetCtrlNoSanitizeImpl(c, i, h);
  536|   198M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119DoSanitizeOnSetCtrlERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  507|   200M|                                size_t slot_size) {
  508|   200M|  const size_t cap = c.capacity();
  509|   200M|  ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   200M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  510|   200M|  ABSL_SWISSTABLE_ASSERT(i < cap);
  ------------------
  |  |   66|   200M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  511|   200M|  auto* slot_i = static_cast<const char*>(c.slot_array(cap)) + i * slot_size;
  512|   200M|  if (IsFull(h)) {
  ------------------
  |  Branch (512:7): [True: 200M, False: 0]
  ------------------
  513|   200M|    SanitizerUnpoisonMemoryRegion(slot_i, slot_size);
  514|   200M|  } else {
  515|      0|    SanitizerPoisonMemoryRegion(slot_i, slot_size);
  516|      0|  }
  517|   200M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_121SetCtrlNoSanitizeImplERKNS1_12CommonFieldsEmNS1_6ctrl_tE:
  523|   198M|inline void SetCtrlNoSanitizeImpl(const CommonFields& c, size_t i, ctrl_t h) {
  524|       |  ABSL_SWISSTABLE_ASSERT(i < c.capacity());
  ------------------
  |  |   66|   198M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  525|   198M|  ctrl_t* ctrl = c.control();
  526|   198M|  const size_t cap = c.capacity();
  527|   198M|  ctrl[i] = h;
  528|   198M|  ctrl[((i - NumClonedBytes()) & cap) + (NumClonedBytes() & cap)] = h;
  529|   198M|}
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|  94.7k|                     size_t occupied_elements) {
  471|  94.7k|  growth_info.InitGrowthLeftNoDeleted(
  472|  94.7k|      CapacityToGrowth(capacity) - occupied_elements, capacity);
  473|  94.7k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117AllocBackingArrayERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmbPvm:
 1085|   109k|                                   void* alloc, size_t blocked_element_count) {
 1086|   109k|  RawHashSetLayout layout(new_capacity, policy.slot_size, policy.slot_align,
 1087|   109k|                          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|   109k|  constexpr size_t kDefaultAlignment = BackingArrayAlignment(alignof(size_t));
 1091|   109k|  char* mem = static_cast<char*>(
 1092|   109k|      ABSL_PREDICT_TRUE(
  ------------------
  |  |  191|   109k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 109k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 109k]
  |  |  |  Branch (191:57): [True: 109k, False: 0]
  |  |  ------------------
  ------------------
 1093|   109k|          policy.alloc ==
 1094|   109k|          (&AllocateBackingArray<kDefaultAlignment, std::allocator<char>>))
 1095|   109k|          ? AllocateBackingArray<kDefaultAlignment, std::allocator<char>>(
 1096|   109k|                alloc, layout.alloc_size())
 1097|   109k|          : policy.alloc(alloc, layout.alloc_size()));
 1098|   109k|  const GenerationType old_generation = common.generation();
 1099|   109k|  common.set_generation_ptr(
 1100|   109k|      reinterpret_cast<GenerationType*>(mem + layout.generation_offset()));
 1101|   109k|  common.set_generation(NextGeneration(old_generation));
 1102|       |
 1103|   109k|  return {reinterpret_cast<ctrl_t*>(mem + layout.control_offset()),
 1104|   109k|          mem + layout.slot_offset()};
 1105|   109k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_124Grow1To3AndPrepareInsertERNS1_12CommonFieldsERKNS1_15PolicyFunctionsENS0_11FunctionRefIFmmEEE:
 1717|  7.50k|                               absl::FunctionRef<size_t(size_t)> get_hash) {
 1718|       |  // TODO(b/413062340): Refactor to reuse more code with
 1719|       |  // GrowSooTableToNextCapacityAndPrepareInsert.
 1720|  7.50k|  ABSL_SWISSTABLE_ASSERT(common.capacity() == 1);
  ------------------
  |  |   66|  7.50k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1721|  7.50k|  ABSL_SWISSTABLE_ASSERT(!common.empty());
  ------------------
  |  |   66|  7.50k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1722|  7.50k|  ABSL_SWISSTABLE_ASSERT(!policy.soo_enabled);
  ------------------
  |  |   66|  7.50k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1723|       |  // 1-element tables can't have any blocked elements.
 1724|  7.50k|  ABSL_SWISSTABLE_ASSERT(common.blocked_element_count() == 0);
  ------------------
  |  |   66|  7.50k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1725|  7.50k|  constexpr size_t kOldCapacity = 1;
 1726|  7.50k|  constexpr size_t kNewCapacity = NextCapacity(kOldCapacity);
 1727|  7.50k|  void* old_slots = common.slot_array(kOldCapacity);
 1728|       |
 1729|  7.50k|  const size_t slot_size = policy.slot_size;
 1730|  7.50k|  const size_t slot_align = policy.slot_align;
 1731|  7.50k|  void* alloc = policy.get_char_alloc(common);
 1732|  7.50k|  HashtablezInfoHandle infoz = common.infoz();
 1733|  7.50k|  const bool has_infoz = infoz.IsSampled();
 1734|  7.50k|  common.set_capacity(kNewCapacity);
 1735|       |
 1736|  7.50k|  const auto [new_ctrl, new_slots] =
 1737|  7.50k|      AllocBackingArray(common, policy, kNewCapacity, has_infoz, alloc,
 1738|  7.50k|                        /*blocked_element_count=*/0);
 1739|  7.50k|  common.set_control(new_ctrl);
 1740|  7.50k|  SanitizerPoisonMemoryRegion(new_slots, kNewCapacity * slot_size);
 1741|       |
 1742|  7.50k|  if (ABSL_PREDICT_TRUE(!has_infoz)) {
  ------------------
  |  |  191|  7.50k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 7.50k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 7.50k]
  |  |  |  Branch (191:57): [True: 7.50k, False: 0]
  |  |  ------------------
  ------------------
 1743|       |    // When we're sampled, we already have a seed.
 1744|  7.50k|    common.generate_new_seed(/*has_infoz=*/false);
 1745|  7.50k|  }
 1746|  7.50k|  const size_t new_hash = get_hash(common.seed().seed());
 1747|  7.50k|  h2_t new_h2 = H2(new_hash);
 1748|  7.50k|  size_t orig_hash =
 1749|  7.50k|      policy.hash_slot(policy.hash_fn(common), old_slots, common.seed().seed());
 1750|  7.50k|  size_t offset = Resize1To3NewOffset(new_hash, common.seed());
 1751|  7.50k|  InitializeThreeElementsControlBytes(H2(orig_hash), new_h2, offset, new_ctrl);
 1752|       |
 1753|  7.50k|  void* old_element_target = NextSlot(new_slots, slot_size);
 1754|  7.50k|  SanitizerUnpoisonMemoryRegion(old_element_target, slot_size);
 1755|  7.50k|  policy.transfer_n(&common, old_element_target, old_slots, 1);
 1756|       |
 1757|  7.50k|  void* new_element_target_slot = SlotAddress(new_slots, offset, slot_size);
 1758|  7.50k|  SanitizerUnpoisonMemoryRegion(new_element_target_slot, slot_size);
 1759|       |
 1760|  7.50k|  policy.dealloc(alloc, kOldCapacity,
 1761|       |                 // old_slots == old_ctrl in case of capacity == 1.
 1762|  7.50k|                 static_cast<ctrl_t*>(old_slots),
 1763|  7.50k|                 slot_size, slot_align, has_infoz,
 1764|  7.50k|                 /*blocked_element_count=*/0);
 1765|  7.50k|  PrepareInsertCommon(common);
 1766|  7.50k|  ABSL_SWISSTABLE_ASSERT(common.size() == 2);
  ------------------
  |  |   66|  7.50k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1767|  7.50k|  GetGrowthInfoFromControl(new_ctrl).InitGrowthLeftNoDeleted(kNewCapacity - 2,
 1768|  7.50k|                                                             kNewCapacity);
 1769|       |
 1770|  7.50k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  7.50k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7.50k]
  |  |  |  Branch (190:49): [Folded, False: 7.50k]
  |  |  |  Branch (190:58): [True: 0, False: 7.50k]
  |  |  ------------------
  ------------------
 1771|      0|    ReportSingleGroupTableGrowthToInfoz(common, infoz, new_hash);
 1772|      0|  }
 1773|  7.50k|  return new_element_target_slot;
 1774|  7.50k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_18NextSlotEPvmm:
  129|  22.5k|inline void* NextSlot(void* slot, size_t slot_size, size_t i = 1) {
  130|  22.5k|  return reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(slot) +
  131|  22.5k|                                 slot_size * i);
  132|  22.5k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_125SetCtrlInSingleGroupTableERKNS1_12CommonFieldsEmhm:
  565|  15.0k|                                      size_t slot_size) {
  566|  15.0k|  SetCtrlInSingleGroupTable(c, i, static_cast<ctrl_t>(h), slot_size);
  567|  15.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_125SetCtrlInSingleGroupTableERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  554|  15.0k|                                      size_t slot_size) {
  555|  15.0k|  const size_t cap = c.capacity();
  556|  15.0k|  ABSL_SWISSTABLE_ASSERT(!c.is_small());
  ------------------
  |  |   66|  15.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  557|       |  ABSL_SWISSTABLE_ASSERT(is_single_group(cap));
  ------------------
  |  |   66|  15.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  558|  15.0k|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  559|  15.0k|  ctrl_t* ctrl = c.control();
  560|  15.0k|  ctrl[i] = h;
  561|  15.0k|  ctrl[i + cap + 1] = h;
  562|  15.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119find_first_non_fullERKNS1_12CommonFieldsEm:
  207|  1.62M|FindInfo find_first_non_full(const CommonFields& common, size_t hash) {
  208|  1.62M|  return find_first_non_full_from_h1(common.control(), H1(hash),
  209|  1.62M|                                     common.capacity_impl());
  210|  1.62M|}
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: 669k, False: 1.07M]
  ------------------
  194|   669k|    return {seq.offset(), /*probe_length=*/0};
  195|   669k|  }
  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: 197k]
  ------------------
  182|  1.07M|      return mask;
  183|  1.07M|    }
  184|   197k|    seq.next();
  185|       |    ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity && "full table!");
  ------------------
  |  |   66|   197k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  186|   197k|  }
  187|  1.07M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_17SetCtrlERKNS1_12CommonFieldsEmhm:
  538|   198M|inline void SetCtrl(const CommonFields& c, size_t i, h2_t h, size_t slot_size) {
  539|   198M|  SetCtrl(c, i, static_cast<ctrl_t>(h), slot_size);
  540|   198M|}
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|   200M|                             FindInfo target_group) {
 2375|   200M|  ABSL_SWISSTABLE_ASSERT(!common.is_small());
  ------------------
  |  |   66|   200M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2376|   200M|  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|   200M|  if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|   200M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 1.63M, False: 198M]
  |  |  |  Branch (190:49): [Folded, False: 200M]
  |  |  |  Branch (190:58): [True: 1.63M, False: 198M]
  |  |  ------------------
  ------------------
 2381|   200M|          !growth_info.GetGrowthInfoLowerBound().HasNoDeletedAndGrowthLeft())) {
 2382|  1.63M|    return PrepareInsertLargeSlow(common, policy, hash);
 2383|  1.63M|  }
 2384|   198M|  PrepareInsertCommon(common);
 2385|   198M|  growth_info.OverwriteEmptyAsFull();
 2386|   198M|  const size_t cap = common.capacity();
 2387|   198M|  ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   198M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2388|   198M|  target_group.offset += mask_empty.LowestBitSet();
 2389|   198M|  target_group.offset &= cap;
 2390|   198M|  SetCtrl(common, target_group.offset, H2(hash), policy.slot_size);
 2391|   198M|  common.infoz().RecordInsertMiss(hash, target_group.probe_length);
 2392|   198M|  return SlotAddress(common.slot_array(cap), target_group.offset,
 2393|   198M|                     policy.slot_size);
 2394|   200M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_122PrepareInsertLargeSlowERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1970|  1.63M|                             size_t hash) {
 1971|  1.63M|  GrowthInfoAccessor growth_info = common.growth_info();
 1972|  1.63M|  const size_t cap = common.capacity();
 1973|  1.63M|  ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|  1.63M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1974|  1.63M|  GrowthInfoLowerBound growth_info_lower_bound =
 1975|  1.63M|      growth_info.RebalanceGrowthLeftLowerBound(cap);
 1976|  1.63M|  if (ABSL_PREDICT_TRUE(
  ------------------
  |  |  191|  1.63M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 94.7k, False: 1.54M]
  |  |  |  Branch (191:48): [Folded, False: 1.63M]
  |  |  |  Branch (191:57): [True: 94.7k, False: 1.54M]
  |  |  ------------------
  ------------------
 1977|  1.63M|          growth_info_lower_bound.HasNoGrowthLeftAndNoDeleted())) {
 1978|       |    // Table without deleted slots (>95% cases) that needs to be resized.
 1979|  94.7k|    return GrowToNextCapacityAndPrepareInsert(common, policy, hash);
 1980|  94.7k|  }
 1981|  1.54M|  if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|  1.54M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1.54M]
  |  |  |  Branch (190:49): [Folded, False: 1.54M]
  |  |  |  Branch (190:58): [True: 0, False: 1.54M]
  |  |  ------------------
  ------------------
 1982|  1.54M|          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.54M|  FindInfo target = find_first_non_full(common, hash);
 1991|  1.54M|  PrepareInsertCommon(common);
 1992|  1.54M|  growth_info.OverwriteControlAsFull(common.control()[target.offset]);
 1993|  1.54M|  SetCtrlInLargeTable(common, target.offset, H2(hash), policy.slot_size);
 1994|  1.54M|  common.infoz().RecordInsertMiss(hash, target.probe_length);
 1995|  1.54M|  return SlotAddress(common.slot_array(cap), target.offset, policy.slot_size);
 1996|  1.54M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_134GrowToNextCapacityAndPrepareInsertERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1780|  94.7k|    size_t new_hash) {
 1781|  94.7k|  const size_t old_capacity = common.capacity();
 1782|  94.7k|  ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |   66|  94.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1783|  94.7k|      common.growth_info().GetGrowthLeftTotalSlow(old_capacity) == 0);
 1784|  94.7k|  ABSL_SWISSTABLE_ASSERT(old_capacity > policy.soo_capacity());
  ------------------
  |  |   66|  94.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1785|  94.7k|  ABSL_SWISSTABLE_ASSERT(!IsSmallCapacity(old_capacity));
  ------------------
  |  |   66|  94.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1786|  94.7k|  ABSL_ASSUME(old_capacity > kMaxSmallCapacity);
  ------------------
  |  |  272|  94.7k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1787|       |
 1788|  94.7k|  const size_t new_capacity = NextCapacity(old_capacity);
 1789|  94.7k|  ctrl_t* old_ctrl = common.control();
 1790|  94.7k|  void* old_slots = common.slot_array(old_capacity);
 1791|  94.7k|  size_t old_blocked_element_count = common.blocked_element_count();
 1792|       |
 1793|  94.7k|  HashtablezInfoHandle infoz = common.infoz();
 1794|  94.7k|  const bool has_infoz = infoz.IsSampled();
 1795|  94.7k|  common.set_capacity(new_capacity);
 1796|  94.7k|  common.set_blocked_element_count_to_zero();
 1797|  94.7k|  const size_t slot_size = policy.slot_size;
 1798|  94.7k|  const size_t slot_align = policy.slot_align;
 1799|  94.7k|  void* alloc = policy.get_char_alloc(common);
 1800|       |
 1801|  94.7k|  const auto [new_ctrl, new_slots] =
 1802|  94.7k|      AllocBackingArray(common, policy, new_capacity, has_infoz, alloc,
 1803|  94.7k|                        /*blocked_element_count=*/0);
 1804|  94.7k|  common.set_control(new_ctrl);
 1805|  94.7k|  SanitizerPoisonMemoryRegion(new_slots, new_capacity * slot_size);
 1806|       |
 1807|  94.7k|  h2_t new_h2 = H2(new_hash);
 1808|  94.7k|  size_t total_probe_length = 0;
 1809|  94.7k|  FindInfo find_info;
 1810|  94.7k|  if (ABSL_PREDICT_TRUE(is_single_group(new_capacity))) {
  ------------------
  |  |  191|  94.7k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 15.0k, False: 79.7k]
  |  |  |  Branch (191:48): [Folded, False: 94.7k]
  |  |  |  Branch (191:57): [True: 15.0k, False: 79.7k]
  |  |  ------------------
  ------------------
 1811|  15.0k|    size_t offset;
 1812|  15.0k|    const size_t old_size = common.size();
 1813|  15.0k|    GrowIntoSingleGroupShuffleControlBytes(old_ctrl, old_capacity,
 1814|  15.0k|                                           old_blocked_element_count, new_ctrl,
 1815|  15.0k|                                           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|  15.0k|    offset =
 1819|  15.0k|        SingleGroupTableH1(new_hash, common.seed()) & 1 ? 0 : new_capacity - 1;
  ------------------
  |  Branch (1819:9): [True: 7.36k, False: 7.63k]
  ------------------
 1820|       |
 1821|  15.0k|    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[offset]));
  ------------------
  |  |   66|  15.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1822|  15.0k|    SetCtrlInSingleGroupTable(common, offset, new_h2, policy.slot_size);
 1823|  15.0k|    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|  15.0k|    ABSL_SWISSTABLE_ASSERT(common.size() + old_blocked_element_count ==
  ------------------
  |  |   66|  15.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1827|  15.0k|                           old_capacity);
 1828|  15.0k|    void* target = NextSlot(new_slots, slot_size);
 1829|  15.0k|    SanitizerUnpoisonMemoryRegion(target, old_size * slot_size);
 1830|  15.0k|    policy.transfer_n(&common, target, old_slots, old_size);
 1831|  79.7k|  } else {
 1832|  79.7k|    total_probe_length =
 1833|  79.7k|        GrowToNextCapacityDispatch(common, policy, old_ctrl, old_slots);
 1834|  79.7k|    find_info = find_first_non_full(common, new_hash);
 1835|  79.7k|    SetCtrlInLargeTable(common, find_info.offset, new_h2, policy.slot_size);
 1836|  79.7k|  }
 1837|  94.7k|  ABSL_SWISSTABLE_ASSERT(old_capacity > policy.soo_capacity());
  ------------------
  |  |   66|  94.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1838|  94.7k|  (*policy.dealloc)(alloc, old_capacity, old_ctrl, slot_size, slot_align,
 1839|  94.7k|                    has_infoz, old_blocked_element_count);
 1840|  94.7k|  PrepareInsertCommon(common);
 1841|  94.7k|  ResetGrowthLeft(GetGrowthInfoFromControl(new_ctrl), new_capacity,
 1842|  94.7k|                  common.size());
 1843|       |
 1844|  94.7k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  94.7k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 94.7k]
  |  |  |  Branch (190:49): [Folded, False: 94.7k]
  |  |  |  Branch (190:58): [True: 0, False: 94.7k]
  |  |  ------------------
  ------------------
 1845|      0|    ReportGrowthToInfoz(common, infoz, new_hash, total_probe_length,
 1846|      0|                        find_info.probe_length);
 1847|      0|  }
 1848|  94.7k|  return SlotAddress(new_slots, find_info.offset, policy.slot_size);
 1849|  94.7k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_138GrowIntoSingleGroupShuffleControlBytesEPNS1_6ctrl_tEmmS4_m:
 1233|  15.0k|                                            size_t new_capacity) {
 1234|  15.0k|  ABSL_SWISSTABLE_ASSERT(is_single_group(new_capacity));
  ------------------
  |  |   66|  15.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1235|  15.0k|  constexpr size_t kHalfWidth = Group::kWidth / 2;
 1236|  15.0k|  ABSL_ASSUME(old_capacity < kHalfWidth);
  ------------------
  |  |  272|  15.0k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1237|  15.0k|  ABSL_ASSUME(old_capacity > 0);
  ------------------
  |  |  272|  15.0k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1238|  15.0k|  static_assert(Group::kWidth == 8 || Group::kWidth == 16,
 1239|  15.0k|                "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|  15.0k|  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|  15.0k|  static constexpr uint64_t kEmptyXorSentinel =
 1262|  15.0k|      static_cast<uint8_t>(ctrl_t::kEmpty) ^
 1263|  15.0k|      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|  15.0k|  copied_bytes ^= kEmptyXorSentinel;
 1272|       |
 1273|  15.0k|  if (ABSL_PREDICT_FALSE(old_blocked_element_count > 0)) {
  ------------------
  |  |  190|  15.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 15.0k]
  |  |  |  Branch (190:49): [Folded, False: 15.0k]
  |  |  |  Branch (190:58): [True: 0, False: 15.0k]
  |  |  ------------------
  ------------------
 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|  15.0k|  if (Group::kWidth == 8) {
  ------------------
  |  Branch (1289:7): [Folded, False: 15.0k]
  ------------------
 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|  15.0k|  ABSL_SWISSTABLE_ASSERT(Group::kWidth == 16);  // NOLINT(misc-static-assert)
  ------------------
  |  |   66|  15.0k|  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|  15.0k|  std::memset(new_ctrl + kHalfWidth, static_cast<int8_t>(ctrl_t::kEmpty),
 1324|  15.0k|              kHalfWidth);
 1325|       |  // Fill the second half of the mirrored control bytes with kEmpty.
 1326|  15.0k|  std::memset(new_ctrl + new_capacity + kHalfWidth,
 1327|  15.0k|              static_cast<int8_t>(ctrl_t::kEmpty), kHalfWidth);
 1328|       |  // Copy the first half of the non-mirrored control bytes.
 1329|  15.0k|  absl::little_endian::Store64(new_ctrl, copied_bytes);
 1330|  15.0k|  new_ctrl[new_capacity] = ctrl_t::kSentinel;
 1331|       |  // Copy the first half of the mirrored control bytes.
 1332|  15.0k|  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|  15.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_126GrowToNextCapacityDispatchERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1686|  79.7k|                                  ctrl_t* old_ctrl, void* old_slots) {
 1687|  79.7k|  const size_t new_capacity = common.capacity();
 1688|  79.7k|  if (ABSL_PREDICT_TRUE(new_capacity <= kMaxLocalBufferNewCapacity)) {
  ------------------
  |  |  191|  79.7k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 30.0k, False: 49.7k]
  |  |  |  Branch (191:48): [Folded, False: 79.7k]
  |  |  |  Branch (191:57): [True: 30.0k, False: 49.7k]
  |  |  ------------------
  ------------------
 1689|  30.0k|    return GrowToNextCapacityThatFitsInLocalBuffer(common, policy, old_ctrl,
 1690|  30.0k|                                                   old_slots);
 1691|  49.7k|  } else {
 1692|  49.7k|    return GrowToNextCapacityOverflowLocalBuffer(common, policy, old_ctrl,
 1693|  49.7k|                                                 old_slots);
 1694|  49.7k|  }
 1695|  79.7k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_139GrowToNextCapacityThatFitsInLocalBufferERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1636|  30.0k|    ctrl_t* old_ctrl, void* old_slots) {
 1637|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= kMaxLocalBufferNewCapacity);
  ------------------
  |  |   66|  30.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1638|  30.0k|  return GrowToNextCapacity<
 1639|  30.0k|      ProbedItemEncoder<ProbedItem4Bytes, /*kGuaranteedFitToBuffer=*/true>>(
 1640|  30.0k|      common, policy, old_ctrl, old_slots);
 1641|  30.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1617|  30.0k|                          ctrl_t* old_ctrl, void* old_slots) {
 1618|  30.0k|  using ProbedItem = typename Encoder::ProbedItem;
 1619|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   66|  30.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1620|  30.0k|  Encoder encoder(old_ctrl);
 1621|  30.0k|  policy.transfer_unprobed_elements_to_next_capacity(
 1622|  30.0k|      common, old_ctrl, old_slots, &encoder,
 1623|  30.0k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  30.0k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  30.0k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  30.0k|      });
 1627|  30.0k|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1628|  30.0k|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1629|  30.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEC2EPNS1_6ctrl_tE:
 1485|  30.0k|  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|  30.9k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  30.9k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  30.9k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  30.9k|      });
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EE10EncodeItemES5_:
 1488|  30.9k|  void EncodeItem(ProbedItem item) {
 1489|  30.9k|    if (ABSL_PREDICT_FALSE(!kGuaranteedFitToBuffer && pos_ >= end_)) {
  ------------------
  |  |  190|  30.9k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [Folded, False: 30.9k]
  |  |  |  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|  30.9k|    ABSL_SWISSTABLE_ASSERT(pos_ < end_);
  ------------------
  |  |   66|  30.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1493|  30.9k|    *pos_ = item;
 1494|  30.9k|    ++pos_;
 1495|  30.9k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_130InitializeMirroredControlBytesEPNS1_6ctrl_tEm:
 1461|  79.7k|void InitializeMirroredControlBytes(ctrl_t* new_ctrl, size_t new_capacity) {
 1462|  79.7k|  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|  79.7k|              new_ctrl - 1, Group::kWidth);
 1466|  79.7k|  new_ctrl[new_capacity] = ctrl_t::kSentinel;
 1467|  79.7k|}
raw_hash_set.cc:_ZNK4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1502|  30.0k|                                void* old_slots) const {
 1503|  30.0k|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1503:9): [True: 16.5k, False: 13.4k]
  ------------------
 1504|  16.5k|      return 0;
 1505|  16.5k|    }
 1506|  13.4k|    if constexpr (kGuaranteedFitToBuffer) {
 1507|  13.4k|      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1508|  13.4k|    }
 1509|      0|    size_t total_probe_length = DecodeAndInsertImpl(
 1510|  13.4k|        common, policy, buffer_,
 1511|  13.4k|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1511:9): [True: 0, False: 13.4k]
  ------------------
 1512|  13.4k|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1512:9): [True: 0, False: 13.4k]
  ------------------
 1513|      0|      return total_probe_length;
 1514|      0|    }
 1515|  13.4k|    total_probe_length +=
 1516|  13.4k|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1517|  13.4k|    return total_probe_length;
 1518|  13.4k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119DecodeAndInsertImplINS1_14ProbedItemImplIjLm32EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPKT_SD_Pv:
 1384|  32.4k|    const ProbedItem* start, const ProbedItem* end, void* old_slots) {
 1385|  32.4k|  const HashtableCapacity new_capacity = c.capacity_impl();
 1386|       |
 1387|  32.4k|  void* new_slots = c.slot_array(new_capacity.capacity());
 1388|  32.4k|  ctrl_t* new_ctrl = c.control();
 1389|  32.4k|  size_t total_probe_length = 0;
 1390|       |
 1391|  32.4k|  const size_t slot_size = policy.slot_size;
 1392|  32.4k|  auto transfer_n = policy.transfer_n;
 1393|       |
 1394|   123k|  for (; start < end; ++start) {
  ------------------
  |  Branch (1394:10): [True: 91.0k, False: 32.4k]
  ------------------
 1395|  91.0k|    const FindInfo target = find_first_non_full_from_h1(
 1396|  91.0k|        new_ctrl, static_cast<size_t>(start->h1), new_capacity);
 1397|  91.0k|    total_probe_length += target.probe_length;
 1398|  91.0k|    const size_t old_index = static_cast<size_t>(start->source_offset);
 1399|  91.0k|    const size_t new_i = target.offset;
 1400|  91.0k|    ABSL_SWISSTABLE_ASSERT(old_index < new_capacity.capacity() / 2);
  ------------------
  |  |   66|  91.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1401|  91.0k|    ABSL_SWISSTABLE_ASSERT(new_i < new_capacity.capacity());
  ------------------
  |  |   66|  91.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1402|       |    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_i]));
  ------------------
  |  |   66|  91.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1403|  91.0k|    void* src_slot = SlotAddress(old_slots, old_index, slot_size);
 1404|  91.0k|    void* dst_slot = SlotAddress(new_slots, new_i, slot_size);
 1405|  91.0k|    SanitizerUnpoisonMemoryRegion(dst_slot, slot_size);
 1406|  91.0k|    transfer_n(&c, dst_slot, src_slot, 1);
 1407|  91.0k|    SetCtrlInLargeTable(c, new_i, static_cast<h2_t>(start->h2), slot_size);
 1408|  91.0k|  }
 1409|  32.4k|  return total_probe_length;
 1410|  32.4k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_137GrowToNextCapacityOverflowLocalBufferERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1669|  49.7k|    ctrl_t* old_ctrl, void* old_slots) {
 1670|  49.7k|  const size_t new_capacity = common.capacity();
 1671|  49.7k|  if (ABSL_PREDICT_TRUE(new_capacity <= ProbedItem4Bytes::kMaxNewCapacity)) {
  ------------------
  |  |  191|  49.7k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 36.2k, False: 13.4k]
  |  |  |  Branch (191:48): [Folded, False: 49.7k]
  |  |  |  Branch (191:57): [True: 36.2k, False: 13.4k]
  |  |  ------------------
  ------------------
 1672|  36.2k|    return GrowToNextCapacity4BytesEncoder(common, policy, old_ctrl, old_slots);
 1673|  36.2k|  }
 1674|  13.4k|  if (ABSL_PREDICT_TRUE(new_capacity <= ProbedItem8Bytes::kMaxNewCapacity)) {
  ------------------
  |  |  191|  13.4k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 13.4k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 13.4k]
  |  |  |  Branch (191:57): [True: 13.4k, False: 0]
  |  |  ------------------
  ------------------
 1675|  13.4k|    return GrowToNextCapacity8BytesEncoder(common, policy, old_ctrl, old_slots);
 1676|  13.4k|  }
 1677|       |  // 16 bytes encoding supports the maximum swisstable capacity.
 1678|      0|  return GrowToNextCapacity16BytesEncoder(common, policy, old_ctrl, old_slots);
 1679|  13.4k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_131GrowToNextCapacity4BytesEncoderERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1647|  36.2k|                                       ctrl_t* old_ctrl, void* old_slots) {
 1648|  36.2k|  return GrowToNextCapacity<ProbedItemEncoder<ProbedItem4Bytes>>(
 1649|  36.2k|      common, policy, old_ctrl, old_slots);
 1650|  36.2k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1617|  36.2k|                          ctrl_t* old_ctrl, void* old_slots) {
 1618|  36.2k|  using ProbedItem = typename Encoder::ProbedItem;
 1619|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   66|  36.2k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1620|  36.2k|  Encoder encoder(old_ctrl);
 1621|  36.2k|  policy.transfer_unprobed_elements_to_next_capacity(
 1622|  36.2k|      common, old_ctrl, old_slots, &encoder,
 1623|  36.2k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  36.2k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  36.2k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  36.2k|      });
 1627|  36.2k|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1628|  36.2k|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1629|  36.2k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EEC2EPNS1_6ctrl_tE:
 1485|  36.2k|  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|  60.1k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  60.1k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  60.1k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  60.1k|      });
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EE10EncodeItemES5_:
 1488|  60.1k|  void EncodeItem(ProbedItem item) {
 1489|  60.1k|    if (ABSL_PREDICT_FALSE(!kGuaranteedFitToBuffer && pos_ >= end_)) {
  ------------------
  |  |  190|   120k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 60.1k]
  |  |  |  Branch (190:49): [Folded, False: 60.1k]
  |  |  |  Branch (190:59): [True: 60.1k, Folded]
  |  |  |  Branch (190:59): [True: 0, False: 60.1k]
  |  |  ------------------
  ------------------
 1490|      0|      return ProcessEncodeWithOverflow(item);
 1491|      0|    }
 1492|  60.1k|    ABSL_SWISSTABLE_ASSERT(pos_ < end_);
  ------------------
  |  |   66|  60.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1493|  60.1k|    *pos_ = item;
 1494|  60.1k|    ++pos_;
 1495|  60.1k|  }
raw_hash_set.cc:_ZNK4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1502|  36.2k|                                void* old_slots) const {
 1503|  36.2k|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1503:9): [True: 17.2k, False: 18.9k]
  ------------------
 1504|  17.2k|      return 0;
 1505|  17.2k|    }
 1506|       |    if constexpr (kGuaranteedFitToBuffer) {
 1507|       |      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1508|       |    }
 1509|  18.9k|    size_t total_probe_length = DecodeAndInsertImpl(
 1510|  18.9k|        common, policy, buffer_,
 1511|  18.9k|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1511:9): [True: 0, False: 18.9k]
  ------------------
 1512|  18.9k|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1512:9): [True: 18.9k, False: 0]
  ------------------
 1513|  18.9k|      return total_probe_length;
 1514|  18.9k|    }
 1515|      0|    total_probe_length +=
 1516|      0|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1517|      0|    return total_probe_length;
 1518|  18.9k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_131GrowToNextCapacity8BytesEncoderERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1653|  13.4k|                                       ctrl_t* old_ctrl, void* old_slots) {
 1654|  13.4k|  return GrowToNextCapacity<ProbedItemEncoder<ProbedItem8Bytes>>(
 1655|  13.4k|      common, policy, old_ctrl, old_slots);
 1656|  13.4k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1617|  13.4k|                          ctrl_t* old_ctrl, void* old_slots) {
 1618|  13.4k|  using ProbedItem = typename Encoder::ProbedItem;
 1619|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   66|  13.4k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1620|  13.4k|  Encoder encoder(old_ctrl);
 1621|  13.4k|  policy.transfer_unprobed_elements_to_next_capacity(
 1622|  13.4k|      common, old_ctrl, old_slots, &encoder,
 1623|  13.4k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  13.4k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  13.4k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  13.4k|      });
 1627|  13.4k|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1628|  13.4k|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1629|  13.4k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EEC2EPNS1_6ctrl_tE:
 1485|  13.4k|  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|  35.1k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  35.1k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  35.1k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  35.1k|      });
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EE10EncodeItemES5_:
 1488|  35.1k|  void EncodeItem(ProbedItem item) {
 1489|  35.1k|    if (ABSL_PREDICT_FALSE(!kGuaranteedFitToBuffer && pos_ >= end_)) {
  ------------------
  |  |  190|  70.3k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 35.1k]
  |  |  |  Branch (190:49): [Folded, False: 35.1k]
  |  |  |  Branch (190:59): [True: 35.1k, Folded]
  |  |  |  Branch (190:59): [True: 0, False: 35.1k]
  |  |  ------------------
  ------------------
 1490|      0|      return ProcessEncodeWithOverflow(item);
 1491|      0|    }
 1492|  35.1k|    ABSL_SWISSTABLE_ASSERT(pos_ < end_);
  ------------------
  |  |   66|  35.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1493|  35.1k|    *pos_ = item;
 1494|  35.1k|    ++pos_;
 1495|  35.1k|  }
raw_hash_set.cc:_ZNK4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1502|  13.4k|                                void* old_slots) const {
 1503|  13.4k|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1503:9): [True: 4.34k, False: 9.13k]
  ------------------
 1504|  4.34k|      return 0;
 1505|  4.34k|    }
 1506|       |    if constexpr (kGuaranteedFitToBuffer) {
 1507|       |      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1508|       |    }
 1509|  9.13k|    size_t total_probe_length = DecodeAndInsertImpl(
 1510|  9.13k|        common, policy, buffer_,
 1511|  9.13k|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1511:9): [True: 0, False: 9.13k]
  ------------------
 1512|  9.13k|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1512:9): [True: 9.13k, False: 0]
  ------------------
 1513|  9.13k|      return total_probe_length;
 1514|  9.13k|    }
 1515|      0|    total_probe_length +=
 1516|      0|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1517|      0|    return total_probe_length;
 1518|  9.13k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119DecodeAndInsertImplINS1_14ProbedItemImplImLm64EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPKT_SD_Pv:
 1384|  9.13k|    const ProbedItem* start, const ProbedItem* end, void* old_slots) {
 1385|  9.13k|  const HashtableCapacity new_capacity = c.capacity_impl();
 1386|       |
 1387|  9.13k|  void* new_slots = c.slot_array(new_capacity.capacity());
 1388|  9.13k|  ctrl_t* new_ctrl = c.control();
 1389|  9.13k|  size_t total_probe_length = 0;
 1390|       |
 1391|  9.13k|  const size_t slot_size = policy.slot_size;
 1392|  9.13k|  auto transfer_n = policy.transfer_n;
 1393|       |
 1394|  44.2k|  for (; start < end; ++start) {
  ------------------
  |  Branch (1394:10): [True: 35.1k, False: 9.13k]
  ------------------
 1395|  35.1k|    const FindInfo target = find_first_non_full_from_h1(
 1396|  35.1k|        new_ctrl, static_cast<size_t>(start->h1), new_capacity);
 1397|  35.1k|    total_probe_length += target.probe_length;
 1398|  35.1k|    const size_t old_index = static_cast<size_t>(start->source_offset);
 1399|  35.1k|    const size_t new_i = target.offset;
 1400|  35.1k|    ABSL_SWISSTABLE_ASSERT(old_index < new_capacity.capacity() / 2);
  ------------------
  |  |   66|  35.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1401|  35.1k|    ABSL_SWISSTABLE_ASSERT(new_i < new_capacity.capacity());
  ------------------
  |  |   66|  35.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1402|       |    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_i]));
  ------------------
  |  |   66|  35.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1403|  35.1k|    void* src_slot = SlotAddress(old_slots, old_index, slot_size);
 1404|  35.1k|    void* dst_slot = SlotAddress(new_slots, new_i, slot_size);
 1405|  35.1k|    SanitizerUnpoisonMemoryRegion(dst_slot, slot_size);
 1406|  35.1k|    transfer_n(&c, dst_slot, src_slot, 1);
 1407|  35.1k|    SetCtrlInLargeTable(c, new_i, static_cast<h2_t>(start->h2), slot_size);
 1408|  35.1k|  }
 1409|  9.13k|  return total_probe_length;
 1410|  9.13k|}
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|   953M|  size_t seed() const { return seed_; }
_ZN4absl12lts_2026081718container_internal12PerTableSeedC2Em:
  610|   953M|      : seed_(static_cast<uint16_t>(seed)) {}
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled36maybe_increment_generation_on_insertEv:
  930|   200M|  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|   109k|  GenerationType generation() const { return 0; }
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled14set_generationEh:
  938|   109k|  void set_generation(GenerationType) {}
_ZNK4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled14generation_ptrEv:
  939|  1.13G|  GenerationType* generation_ptr() const { return nullptr; }
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled18set_generation_ptrEPh:
  940|   109k|  void set_generation_ptr(GenerationType*) {}
_ZN4absl12lts_2026081718container_internal37HashSetIteratorGenerationInfoDisabledC2EPKh:
  963|  1.13G|  explicit HashSetIteratorGenerationInfoDisabled(const GenerationType*) {}
_ZNK4absl12lts_2026081718container_internal37HashSetIteratorGenerationInfoDisabled10generationEv:
  965|  1.44G|  GenerationType generation() const { return 0; }
_ZNK4absl12lts_2026081718container_internal37HashSetIteratorGenerationInfoDisabled14generation_ptrEv:
  967|  2.38G|  const GenerationType* generation_ptr() const { return nullptr; }
_ZN4absl12lts_2026081718container_internal20GrowthInfoLowerBoundC2Eh:
 1023|   204M|      : growth_left_(growth_left) {}
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound25HasNoDeletedAndGrowthLeftEv:
 1028|   200M|  constexpr bool HasNoDeletedAndGrowthLeft() const {
 1029|   200M|    return static_cast<int8_t>(growth_left_) > 0;
 1030|   200M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound23HasDeletedAndGrowthLeftEv:
 1035|  1.59M|  constexpr bool HasDeletedAndGrowthLeft() const {
 1036|  1.59M|    return growth_left_ > kDeletedBit;
 1037|  1.59M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound27HasNoGrowthLeftAndNoDeletedEv:
 1042|  1.63M|  constexpr bool HasNoGrowthLeftAndNoDeleted() const {
 1043|  1.63M|    return growth_left_ == 0;
 1044|  1.63M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound29HasNoGrowthLeftAndHaveDeletedEv:
 1048|  1.54M|  constexpr bool HasNoGrowthLeftAndHaveDeleted() const {
 1049|  1.54M|    return growth_left_ == kDeletedBit;
 1050|  1.54M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound13GetGrowthLeftEv:
 1061|  1.59M|  constexpr uint8_t GetGrowthLeft() const {
 1062|  1.59M|    return growth_left_ & kGrowthLeftMask;
 1063|  1.59M|  }
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessorC2EPv:
 1078|   201M|      : growth_info_lower_bound_(reinterpret_cast<uint8_t*>(control) - 1 -
 1079|   201M|                                 NumGenerationBytes()) {}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor20OverwriteEmptyAsFullEv:
 1096|   198M|  void OverwriteEmptyAsFull() {
 1097|       |    ABSL_SWISSTABLE_ASSERT(GetGrowthLeftLowerBound() > 0);
  ------------------
  |  |  257|   198M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1098|   198M|    --(*growth_info_lower_bound_);
 1099|   198M|  }
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor22OverwriteControlAsFullENS1_6ctrl_tE:
 1103|  1.54M|  void OverwriteControlAsFull(ctrl_t ctrl) {
 1104|       |    ABSL_SWISSTABLE_ASSERT(GetGrowthLeftLowerBound() >=
  ------------------
  |  |  257|  1.54M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1105|  1.54M|                           static_cast<size_t>(IsEmpty(ctrl)));
 1106|  1.54M|    *growth_info_lower_bound_ -= static_cast<size_t>(IsEmpty(ctrl));
 1107|  1.54M|  }
_ZNK4absl12lts_2026081718container_internal18GrowthInfoAccessor23GetGrowthInfoLowerBoundEv:
 1116|   201M|  GrowthInfoLowerBound GetGrowthInfoLowerBound() const {
 1117|   201M|    return GrowthInfoLowerBound(*growth_info_lower_bound_);
 1118|   201M|  }
_ZNK4absl12lts_2026081718container_internal18GrowthInfoAccessor20full_growth_info_ptrEv:
 1131|  1.64M|  void* full_growth_info_ptr() const { return growth_info_lower_bound_ - 7; }
_ZN4absl12lts_2026081718container_internal16RawHashSetLayoutC2Emmmbm:
 1191|   219k|      : control_offset_(MetadataBeforeControlSize(has_infoz, capacity)),
 1192|   219k|        generation_offset_(control_offset_ - NumGenerationBytes()),
 1193|   219k|        slot_offset_(control_offset_ + NumControlBytes(capacity)) {
 1194|   219k|    ABSL_SWISSTABLE_ASSERT(IsValidCapacity(capacity));
  ------------------
  |  |  257|   219k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1195|   219k|    size_t aligned_slot_offset = AlignUpTo(slot_offset_, slot_align);
 1196|   219k|    size_t slot_array_padding = aligned_slot_offset - slot_offset_;
 1197|   219k|    slot_offset_ = aligned_slot_offset;
 1198|   219k|    ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |  257|   219k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1199|   219k|        slot_size <=
 1200|   219k|        ((std::numeric_limits<size_t>::max)() - slot_offset_) / capacity);
 1201|   219k|    control_offset_ += slot_array_padding;
 1202|   219k|    generation_offset_ += slot_array_padding;
 1203|       |    ABSL_SWISSTABLE_ASSERT(!IsSmallCapacity(capacity) ||
  ------------------
  |  |  257|   219k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1204|   219k|                           control_offset_ == slot_offset_);
 1205|   219k|    alloc_size_ = slot_offset_ + (capacity - blocked_element_count) * slot_size;
 1206|   219k|  }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout14control_offsetEv:
 1210|   219k|  size_t control_offset() const { return control_offset_; }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout17generation_offsetEv:
 1214|   109k|  size_t generation_offset() const { return generation_offset_; }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout11slot_offsetEv:
 1218|   109k|  size_t slot_offset() const { return slot_offset_; }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout10alloc_sizeEv:
 1222|   329k|  size_t alloc_size() const { return alloc_size_; }
_ZN4absl12lts_2026081718container_internal9HeapOrSoo7controlEv:
 1260|   109k|  MaybeInitializedPtr<ctrl_t>& control() {
 1261|   109k|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.control);
  ------------------
  |  |  484|   109k|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1262|   109k|  }
_ZNK4absl12lts_2026081718container_internal9HeapOrSoo7controlEv:
 1263|  2.80G|  MaybeInitializedPtr<ctrl_t> control() const {
 1264|  2.80G|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.control);
  ------------------
  |  |  484|  2.80G|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1265|  2.80G|  }
_ZN4absl12lts_2026081718container_internal12CommonFieldsC2ENS1_13non_soo_tag_tE:
 1294|  7.50k|      : inline_data_(HashtableCapacity(0), no_seed_empty_tag_t{}) {}
_ZNK4absl12lts_2026081718container_internal12CommonFields7controlEv:
 1321|  2.80G|  ctrl_t* control() const {
 1322|  2.80G|    ABSL_SWISSTABLE_ASSERT(capacity() > 0);
  ------------------
  |  |  257|  2.80G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1323|       |    // Assume that the control bytes don't alias `this`.
 1324|  2.80G|    ctrl_t* ctrl = heap_or_soo_.control().get();
 1325|  2.80G|    [[maybe_unused]] size_t num_control_bytes = NumControlBytes(capacity());
 1326|  2.80G|    ABSL_ASSUME(reinterpret_cast<uintptr_t>(ctrl + num_control_bytes) <=
  ------------------
  |  |  272|  3.60G|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (272:44): [True: 2.00G, False: 797M]
  |  |  |  Branch (272:44): [True: 797M, False: 0]
  |  |  ------------------
  ------------------
 1327|  2.80G|                    reinterpret_cast<uintptr_t>(this) ||
 1328|  2.80G|                reinterpret_cast<uintptr_t>(this + 1) <=
 1329|  2.80G|                    reinterpret_cast<uintptr_t>(ctrl));
 1330|  2.80G|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(ctrl);
  ------------------
  |  |  484|  2.80G|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1331|  2.80G|  }
_ZN4absl12lts_2026081718container_internal12CommonFields11set_controlEPNS1_6ctrl_tE:
 1333|   109k|  void set_control(ctrl_t* c) { heap_or_soo_.control().set(c); }
_ZNK4absl12lts_2026081718container_internal12CommonFields10slot_arrayEm:
 1341|  1.06G|  void* slot_array(size_t capacity) const {
 1342|       |    ABSL_SWISSTABLE_ASSERT(capacity == this->capacity());
  ------------------
  |  |  257|  1.06G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1343|  1.06G|    ctrl_t* ctrl = control();
 1344|  1.06G|    return ctrl + NumControlBytes(capacity);
 1345|  1.06G|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields4sizeEv:
 1348|   139k|  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|   200M|  void increment_size() {
 1360|       |    ABSL_SWISSTABLE_ASSERT(size() < capacity());
  ------------------
  |  |  257|   200M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1361|   200M|    inline_data_.increment_size();
 1362|   200M|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields5emptyEv:
 1371|  7.50k|  bool empty() const { return inline_data_.empty(); }
_ZNK4absl12lts_2026081718container_internal12CommonFields4seedEv:
 1380|   953M|  PerTableSeed seed() const { return inline_data_.seed(); }
_ZN4absl12lts_2026081718container_internal12CommonFields17generate_new_seedEb:
 1384|  7.50k|  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|  7.50k|    if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  7.50k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7.50k]
  |  |  |  Branch (190:49): [Folded, False: 7.50k]
  |  |  |  Branch (190:58): [True: 0, False: 7.50k]
  |  |  ------------------
  ------------------
 1388|      0|      inline_data_.set_sampled_seed();
 1389|      0|      return;
 1390|      0|    }
 1391|  7.50k|    inline_data_.generate_new_seed();
 1392|  7.50k|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields13capacity_implEv:
 1395|  4.07G|  HashtableCapacity capacity_impl() const {
 1396|  4.07G|    HashtableCapacity cap = inline_data_.capacity();
 1397|       |    ABSL_SWISSTABLE_ASSERT(cap.IsValid());
  ------------------
  |  |  257|  4.07G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1398|  4.07G|    return cap;
 1399|  4.07G|  }
_ZNK4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE8capacityEv:
  551|  4.07G|  constexpr size_t capacity() const {
  552|  4.07G|    ABSL_SWISSTABLE_ASSERT(IsValid());
  ------------------
  |  |  257|  4.07G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  553|  4.07G|    return StorageMode == kCapacityByValue ? capacity_data_
  ------------------
  |  Branch (553:12): [Folded, False: 4.07G]
  ------------------
  554|  4.07G|                                           : (size_t{1} << capacity_data_) - 1;
  555|  4.07G|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields8capacityEv:
 1400|  4.07G|  size_t capacity() const { return capacity_impl().capacity(); }
_ZN4absl12lts_2026081718container_internal12CommonFields12set_capacityENS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEE:
 1406|   109k|  void set_capacity(HashtableCapacity c) { inline_data_.set_capacity(c); }
_ZN4absl12lts_2026081718container_internal12CommonFields12set_capacityEm:
 1407|   109k|  void set_capacity(size_t c) {
 1408|   109k|    set_capacity(HashtableCapacity(c));
 1409|   109k|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields8is_smallEv:
 1410|   666M|  bool is_small() const { return inline_data_.is_small(); }
_ZNK4absl12lts_2026081718container_internal12CommonFields11growth_infoEv:
 1412|   201M|  GrowthInfoAccessor growth_info() const {
 1413|       |    ABSL_SWISSTABLE_ASSERT(GrowthInfoSizeForCapacity(capacity()) > 0);
  ------------------
  |  |  257|   201M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1414|   201M|    return GetGrowthInfoFromControl(control());
 1415|   201M|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields9has_infozEv:
 1417|   200M|  bool has_infoz() const { return inline_data_.has_infoz(); }
_ZN4absl12lts_2026081718container_internal12CommonFields5infozEv:
 1425|   200M|  HashtablezInfoHandle infoz() {
 1426|   200M|    return has_infoz() ? infoz_ptr() : HashtablezInfoHandle();
  ------------------
  |  Branch (1426:12): [True: 0, False: 200M]
  ------------------
 1427|   200M|  }
_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|   102k|  size_t blocked_element_count() const {
 1450|   102k|    return inline_data_.blocked_element_count();
 1451|   102k|  }
_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|  94.7k|  void set_blocked_element_count_to_zero() {
 1460|  94.7k|    inline_data_.set_blocked_element_count_to_zero();
 1461|  94.7k|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields22AssertNotDebugCapacityEv:
 1498|  1.34G|  void AssertNotDebugCapacity() const {
 1499|  1.34G|    if (!SwisstableGenerationsOrDebugEnabled()) {
  ------------------
  |  Branch (1499:9): [True: 1.34G, Folded]
  ------------------
 1500|  1.34G|      return;
 1501|  1.34G|    }
 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|   109k|constexpr GenerationType SentinelEmptyGeneration() { return 0; }
_ZN4absl12lts_2026081718container_internal14NextGenerationEh:
  267|   109k|constexpr GenerationType NextGeneration(GenerationType generation) {
  268|   109k|  return ++generation == SentinelEmptyGeneration() ? ++generation : generation;
  ------------------
  |  Branch (268:10): [True: 0, False: 109k]
  ------------------
  269|   109k|}
_ZN4absl12lts_2026081718container_internal18NumGenerationBytesEv:
  276|   202M|constexpr size_t NumGenerationBytes() { return 0; }
_ZN4absl12lts_2026081718container_internal21InsertIteratorControlEv:
  351|   200M|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|   200M|  return const_cast<ctrl_t*>(kInsertIteratorControl);
  356|   200M|}
_ZN4absl12lts_2026081718container_internal11SooCapacityEv:
  378|      4|constexpr size_t SooCapacity() { return 1; }
_ZN4absl12lts_2026081718container_internal15IsValidCapacityEm:
  395|   200M|constexpr bool IsValidCapacity(size_t n) { return ((n + 1) & n) == 0 && n > 0; }
  ------------------
  |  Branch (395:51): [True: 200M, False: 0]
  |  Branch (395:73): [True: 200M, False: 2]
  ------------------
_ZN4absl12lts_2026081718container_internal15IsSmallCapacityEm:
  398|  3.87G|constexpr bool IsSmallCapacity(size_t capacity) {
  399|  3.87G|  return capacity <= kMaxSmallCapacity;
  400|  3.87G|}
_ZN4absl12lts_2026081718container_internal15is_single_groupEm:
  404|  94.7k|constexpr bool is_single_group(size_t capacity) {
  405|  94.7k|  return capacity <= Group::kWidth;
  406|  94.7k|}
_ZN4absl12lts_2026081718container_internal33IsCapacityValidForBlockedElementsEm:
  410|      4|constexpr bool IsCapacityValidForBlockedElements(size_t cap) {
  411|      4|  return !IsSmallCapacity(cap);
  412|      4|}
_ZN4absl12lts_2026081718container_internal12NextCapacityEm:
  420|  94.7k|constexpr size_t NextCapacity(size_t n) {
  421|       |  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(n) || n == 0);
  ------------------
  |  |  257|  94.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  422|  94.7k|  return n * 2 + 1;
  423|  94.7k|}
_ZN4absl12lts_2026081718container_internal16PreviousCapacityEm:
  426|  79.7k|constexpr size_t PreviousCapacity(size_t n) {
  427|       |  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(n));
  ------------------
  |  |  257|  79.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  428|  79.7k|  return n / 2;
  429|  79.7k|}
_ZN4absl12lts_2026081718container_internal16CapacityToGrowthEm:
  444|  94.7k|constexpr size_t CapacityToGrowth(size_t capacity) {
  445|  94.7k|  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(capacity));
  ------------------
  |  |  257|  94.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  446|       |  // `capacity*7/8`
  447|  94.7k|  if (capacity <= kMaxCapacityForLoadFactorOne) {
  ------------------
  |  Branch (447:7): [True: 30.0k, False: 64.7k]
  ------------------
  448|       |    // For small capacities we leave at most one empty slot.
  449|  30.0k|    return capacity - (capacity >= Group::kWidth - 1);
  450|  30.0k|  }
  451|  64.7k|  return capacity - capacity / 8;
  452|  94.7k|}
_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|   955M|inline size_t H1(size_t hash) { return hash; }
_ZN4absl12lts_2026081718container_internal2H2Em:
  837|  1.15G|inline h2_t H2(size_t hash) { return hash >> (sizeof(size_t) * 8 - 7); }
_ZN4absl12lts_2026081718container_internal14NumClonedBytesEv:
 1149|  4.27G|constexpr size_t NumClonedBytes() { return Group::kWidth - 1; }
_ZN4absl12lts_2026081718container_internal15NumControlBytesEm:
 1152|  3.87G|constexpr size_t NumControlBytes(size_t capacity) {
 1153|  3.87G|  return IsSmallCapacity(capacity) ? 0 : capacity + 1 + NumClonedBytes();
  ------------------
  |  Branch (1153:10): [True: 59.9k, False: 3.87G]
  ------------------
 1154|  3.87G|}
_ZN4absl12lts_2026081718container_internal25GrowthInfoSizeForCapacityEm:
 1158|   219k|constexpr size_t GrowthInfoSizeForCapacity(size_t capacity) {
 1159|   219k|  if (IsSmallCapacity(capacity)) {
  ------------------
  |  Branch (1159:7): [True: 15.0k, False: 204k]
  ------------------
 1160|  15.0k|    return 0;
 1161|  15.0k|  }
 1162|   204k|  return capacity <= GrowthInfoLowerBound::kMaxGrowthLeftLowerBound
  ------------------
  |  Branch (1162:10): [True: 90.0k, False: 114k]
  ------------------
 1163|   204k|             ? sizeof(uint8_t)
 1164|   204k|             : sizeof(uint64_t);
 1165|   219k|}
_ZN4absl12lts_2026081718container_internal25MetadataBeforeControlSizeEbm:
 1169|   219k|constexpr size_t MetadataBeforeControlSize(bool has_infoz, size_t capacity) {
 1170|   219k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|   219k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 219k]
  |  |  |  Branch (190:49): [Folded, False: 219k]
  |  |  |  Branch (190:58): [True: 0, False: 219k]
  |  |  ------------------
  ------------------
 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|   219k|  return GrowthInfoSizeForCapacity(capacity) + NumGenerationBytes();
 1177|   219k|}
_ZN4absl12lts_2026081718container_internal9AlignUpToEmm:
 1181|   219k|constexpr size_t AlignUpTo(size_t offset, size_t align) {
 1182|   219k|  return (offset + align - 1) & (~align + 1);
 1183|   219k|}
_ZN4absl12lts_2026081718container_internal24GetGrowthInfoFromControlEPNS1_6ctrl_tE:
 1279|   201M|inline GrowthInfoAccessor GetGrowthInfoFromControl(ctrl_t* control) {
 1280|   201M|  return GrowthInfoAccessor(control);
 1281|   201M|}
_ZN4absl12lts_2026081718container_internal12AssertIsFullERKPKNS1_6ctrl_tEPKvhPKhPKc:
 1589|   516M|                         const char* operation) {
 1590|   516M|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1590:7): [True: 516M, 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|   932M|                                       const GenerationType* generation_ptr) {
 1634|   932M|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1634:7): [True: 932M, 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|   466M|                                const GenerationType* generation_ptr_b) {
 1695|   466M|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1695:7): [True: 466M, 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|   667M|inline probe_seq<Group::kWidth> probe_h1(ProbeCapacity capacity, size_t h1) {
 1801|   667M|  return probe_seq<Group::kWidth>(capacity, h1);
 1802|   667M|}
_ZN4absl12lts_2026081718container_internal5probeENS1_13ProbeCapacityEm:
 1803|   666M|inline probe_seq<Group::kWidth> probe(ProbeCapacity capacity, size_t hash) {
 1804|   666M|  return probe_h1(capacity, H1(hash));
 1805|   666M|}
_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|  7.50k|constexpr size_t SooSlotIndex() { return 1; }
_ZNK4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE9ToRawDataEv:
  537|   117k|  IntType ToRawData() const { return capacity_data_; }
_ZNK4absl12lts_2026081718container_internal19MaybeInitializedPtrINS1_6ctrl_tEE3getEv:
 1237|  2.80G|  T* get() const { ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(p); }
  ------------------
  |  |  484|  2.80G|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
_ZN4absl12lts_2026081718container_internal19MaybeInitializedPtrINS1_6ctrl_tEE3setEPS3_:
 1238|   109k|  void set(T* ptr) { p = ptr; }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE4sizeEv:
  701|   139k|  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|   200M|  void increment_size() { data_ += kSizeOneNoMetadata; }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE5emptyEv:
  708|  7.50k|  bool empty() const { return data_ < kSizeOneNoMetadata; }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE12ToPublicSeedEm:
  792|   953M|  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|   953M|    return seed << kCapacityBitStoredInDataCount;
  797|   953M|  }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE4seedEv:
  724|   953M|  PerTableSeed seed() const {
  725|   953M|    return PerTableSeed(ToPublicSeed(data_ & kSeedMask));
  726|   953M|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8set_seedEh:
  799|  7.50k|  void set_seed(uint8_t seed) {
  800|  7.50k|    data_ = (data_ & ~kSeedMask) | (seed & kSeedMask);
  801|  7.50k|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE17generate_new_seedEv:
  728|  7.50k|  void generate_new_seed() { set_seed(NextHashTableSeed()); }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8capacityEv:
  692|  4.73G|  HashtableCapacity capacity() const {
  693|  4.73G|    return HashtableCapacity::FromRawData(capacity_internal_);
  694|  4.73G|  }
_ZN4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE11FromRawDataEm:
  532|  4.73G|  static HashtableCapacityImpl FromRawData(uint64_t capacity) {
  533|  4.73G|    auto cap = HashtableCapacityImpl(uninitialized_tag_t{});
  534|  4.73G|    cap.capacity_data_ = static_cast<IntType>(capacity);
  535|  4.73G|    return cap;
  536|  4.73G|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE12set_capacityENS1_21HashtableCapacityImplILS3_1EEE:
  697|   109k|  void set_capacity(HashtableCapacity c) { capacity_internal_ = c.ToRawData(); }
_ZNK4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE8is_smallEv:
  557|   666M|  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|   666M|    static_assert(kMaxSmallCapacity == 1);
  564|   666M|    return capacity_data_ <= 1;
  565|   666M|  }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8is_smallEv:
  695|   666M|  bool is_small() const { return capacity().is_small(); }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE9has_infozEv:
  739|   200M|  bool has_infoz() const {
  740|   200M|    return ABSL_PREDICT_FALSE((data_ & kHasInfozMask) != 0);
  ------------------
  |  |  190|   200M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:49): [Folded, False: 200M]
  |  |  |  Branch (190:58): [True: 0, False: 200M]
  |  |  ------------------
  ------------------
  741|   200M|  }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE21blocked_element_countEv:
  747|   102k|  size_t blocked_element_count() const {
  748|   102k|    return (data_ & kBlockedElementMask) >> kBlockedElementsShift;
  749|   102k|  }
_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|  94.7k|  void set_blocked_element_count_to_zero() { data_ &= ~kBlockedElementMask; }
_ZN4absl12lts_2026081718container_internal12CommonFields13CreateDefaultILb0EEES2_v:
 1312|  7.50k|  static CommonFields CreateDefault() {
 1313|  7.50k|    return kSooEnabled ? CommonFields{soo_tag_t{}}
  ------------------
  |  Branch (1313:12): [Folded, False: 7.50k]
  ------------------
 1314|  7.50k|                       : CommonFields{non_soo_tag_t{}};
 1315|  7.50k|  }
_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.21G|  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|   807M|  CommonFields& common() { return settings_.template get<0>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7to_slotEPv:
 3519|   396M|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3520|   396M|    return static_cast<slot_type*>(buf);
 3521|   396M|  }
_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|  4.73G|  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|   117k|      : capacity_data_(static_cast<IntType>(
  523|   117k|            StorageMode == kCapacityByValue ? capacity
  ------------------
  |  Branch (523:13): [Folded, False: 117k]
  ------------------
  524|   117k|                                            : TrailingZeros(capacity + 1))) {
  525|       |    ABSL_SWISSTABLE_ASSERT(capacity == 0 || IsValidCapacity(capacity));
  ------------------
  |  |  257|   117k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  526|   117k|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EEC2ENS1_21HashtableCapacityImplILS3_1EEENS1_19no_seed_empty_tag_tE:
  685|  7.50k|      : 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|  63.7M|    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|   127M|  void AssertNotDebugCapacity() const { common().AssertNotDebugCapacity(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6commonEv:
 3838|   382M|  const CommonFields& common() const { return settings_.template get<0>(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8is_smallEv:
 2312|  63.7M|  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|  63.7M|  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|   127M|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3520|   127M|    return static_cast<slot_type*>(buf);
 3521|   127M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6commonEv:
 3837|   255M|  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|  63.7M|  const hasher& hash_ref() const { return settings_.template get<1>(); }
_ZN4absl12lts_2026081718container_internal29TryFindNewIndexWithoutProbingIvEEmmmmPNS1_6ctrl_tEm:
 1827|   287M|                                            size_t new_capacity) {
 1828|   287M|  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|   287M|  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|   287M|  index_diff -= in_floating_group_index;
 1839|   287M|  if (ABSL_PREDICT_TRUE((index_diff & old_capacity) == 0)) {
  ------------------
  |  |  191|   287M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 274M, False: 13.1M]
  |  |  |  Branch (191:48): [Folded, False: 287M]
  |  |  |  Branch (191:57): [True: 274M, False: 13.1M]
  |  |  ------------------
  ------------------
 1840|   274M|    size_t new_index = (h1 + in_floating_group_index) & new_capacity;
 1841|   274M|    ABSL_ASSUME(new_index != kProbedElementIndexSentinel);
  ------------------
  |  |  272|   274M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1842|   274M|    return new_index;
 1843|   274M|  }
 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: 118k, False: 13.0M]
  |  |  |  Branch (190:49): [Folded, False: 13.1M]
  |  |  |  Branch (190:58): [True: 118k, False: 13.0M]
  |  |  ------------------
  ------------------
 1852|   118k|    return kProbedElementIndexSentinel;
 1853|   118k|  }
 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: 7.88k]
  |  |  |  Branch (191:48): [Folded, False: 13.0M]
  |  |  |  Branch (191:57): [True: 13.0M, False: 7.88k]
  |  |  ------------------
  ------------------
 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|  7.88k|  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|  63.7M|  void prefetch_heap_block() const {
 3831|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|  63.7M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3832|  63.7M|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3833|  63.7M|    __builtin_prefetch(control(), 0, 1);
 3834|  63.7M|#endif
 3835|  63.7M|  }
_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|   667M|      : capacity_(capacity.capacity), offset_(hash & capacity_) {}
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7controlEv:
 3845|   127M|  ctrl_t* control() const {
 3846|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   127M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3847|   127M|    return common().control();
 3848|   127M|  }
_ZNK4absl12lts_2026081718container_internal9probe_seqILm16EE6offsetEv:
 1782|  1.63G|  size_t offset() const { return offset_; }
_ZNK4absl12lts_2026081718container_internal9probe_seqILm16EE6offsetEm:
 1783|   334M|  size_t offset(size_t i) const { return (offset_ + i) & capacity_; }
_ZNK4absl12lts_2026081718container_internal9probe_seqILm16EE5indexEv:
 1791|   201M|  size_t index() const { return index_; }
_ZN4absl12lts_2026081718container_internal9probe_seqILm16EE4nextEv:
 1785|  47.3M|  void next() {
 1786|  47.3M|    index_ += Width;
 1787|  47.3M|    offset_ += index_;
 1788|  47.3M|    offset_ &= capacity_;
 1789|  47.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|  63.7M|        : HashSetIteratorGenerationInfo(generation_ptr),
 2435|  63.7M|          ctrl_(ctrl),
 2436|  63.7M|          slot_(slot) {
 2437|       |      // This assumption helps the compiler know that any non-end iterator is
 2438|       |      // not equal to any end iterator.
 2439|  63.7M|      ABSL_ASSUME(slot != nullptr);
  ------------------
  |  |  272|  63.7M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2440|  63.7M|    }
_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|   201M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3241|   201M|    return const_cast<raw_hash_set*>(this)->find(key);
 3242|   201M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE4findIS8_EENSA_8iteratorERKT_:
 3225|   201M|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3226|   201M|    AssertOnFind(key);
 3227|   201M|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3227:9): [True: 0, False: 201M]
  ------------------
 3228|   201M|    prefetch_heap_block();
 3229|   201M|    return find_large(key);
 3230|   201M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE12AssertOnFindIS8_EEvRKT_:
 3725|   201M|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|   201M|    AssertHashEqConsistent(key);
 3727|   201M|    AssertNotDebugCapacity();
 3728|   201M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22AssertHashEqConsistentIS8_EEvRKT_:
 3736|   201M|  void AssertHashEqConsistent(const K& key) {
 3737|   201M|#ifdef NDEBUG
 3738|   201M|    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|   411M|  void AssertNotDebugCapacity() const { common().AssertNotDebugCapacity(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8is_smallEv:
 2312|   201M|  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|   234M|                                             slot_type* slot) const {
 3503|   234M|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|   234M|                               PolicyTraits::element(slot));
 3505|   234M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6eq_refEv:
 3892|   234M|  const key_equal& eq_ref() const { return settings_.template get<2>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE3endEv:
 2762|   209M|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2763|   209M|    AssertNotDebugCapacity();
 2764|   209M|    return iterator(common().generation_ptr());
 2765|   209M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorC2EPKh:
 2443|   209M|        : HashSetIteratorGenerationInfo(generation_ptr), slot_(nullptr) {}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorC2EPNS1_6ctrl_tEPNS1_13map_slot_typeIS8_iEEPKh:
 2434|   194M|        : HashSetIteratorGenerationInfo(generation_ptr),
 2435|   194M|          ctrl_(ctrl),
 2436|   194M|          slot_(slot) {
 2437|       |      // This assumption helps the compiler know that any non-end iterator is
 2438|       |      // not equal to any end iterator.
 2439|   194M|      ABSL_ASSUME(slot != nullptr);
  ------------------
  |  |  272|   194M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2440|   194M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE19prefetch_heap_blockEv:
 3830|   201M|  void prefetch_heap_block() const {
 3831|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   201M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3832|   201M|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3833|   201M|    __builtin_prefetch(control(), 0, 1);
 3834|   201M|#endif
 3835|   201M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7controlEv:
 3845|   403M|  ctrl_t* control() const {
 3846|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   403M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3847|   403M|    return common().control();
 3848|   403M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE10find_largeIS8_EENSA_8iteratorERKT_:
 3393|   201M|  iterator find_large(const key_arg<K>& key) {
 3394|   201M|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  257|   201M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3395|   201M|    const size_t cap = common().capacity();
 3396|   201M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   201M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3397|   201M|    const size_t hash = hash_of(key);
 3398|   201M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3399|   201M|    const h2_t h2 = H2(hash);
 3400|   201M|    ctrl_t* ctrl = control();
 3401|   201M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3402|   201M|    while (true) {
  ------------------
  |  Branch (3402:12): [True: 201M, Folded]
  ------------------
 3403|   201M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3404|   201M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3405|   201M|#endif
 3406|   201M|      Group g{ctrl + seq.offset()};
 3407|   234M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3407:23): [True: 234M, False: 7.72M]
  ------------------
 3408|   234M|        const size_t offset = seq.offset(i);
 3409|   234M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array + offset)))
  ------------------
  |  |  191|   234M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 194M, False: 40.3M]
  |  |  |  Branch (191:48): [Folded, False: 234M]
  |  |  |  Branch (191:57): [True: 194M, False: 40.3M]
  |  |  ------------------
  ------------------
 3410|   194M|          return iterator_at_ptr(ctrl + offset, slot_array + offset);
 3411|   234M|      }
 3412|  7.72M|      if (ABSL_PREDICT_TRUE(g.MaskEmpty())) return end();
  ------------------
  |  |  191|  7.72M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 7.72M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 7.72M]
  |  |  |  Branch (191:57): [True: 7.72M, 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|   201M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7hash_ofIS8_EEmRKT_:
 3507|   201M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|   201M|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|   201M|                                               common().seed().seed()}(key);
 3510|   201M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8hash_refEv:
 3890|   201M|  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|   194M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3817|   194M|    return {ctrl, to_slot(slot), common().generation_ptr()};
 3818|   194M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorC2ENSA_8iteratorE:
 2494|   403M|    const_iterator(iterator i) : inner_(std::move(i)) {}  // NOLINT
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE3endEv:
 2770|   201M|  const_iterator end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2771|   201M|    return const_cast<raw_hash_set*>(this)->end();
 2772|   201M|  }
_ZN4absl12lts_2026081718container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorESD_:
 2508|   201M|    friend bool operator!=(const const_iterator& a, const const_iterator& b) {
 2509|   201M|      return !(a == b);
 2510|   201M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorESD_:
 2505|   201M|    friend bool operator==(const const_iterator& a, const const_iterator& b) {
 2506|   201M|      return a.inner_ == b.inner_;
 2507|   201M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorESD_:
 2418|   201M|    friend bool operator==(const iterator& a, const iterator& b) {
 2419|   201M|      AssertIsValidForComparison(a.ctrl_, a.slot_, a.generation(),
 2420|   201M|                                 a.generation_ptr());
 2421|   201M|      AssertIsValidForComparison(b.ctrl_, b.slot_, b.generation(),
 2422|   201M|                                 b.generation_ptr());
 2423|   201M|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2424|   201M|                          a.generation_ptr(), b.generation_ptr());
 2425|   201M|      return a.unchecked_equals(b);
 2426|   201M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator16unchecked_equalsERKSB_:
 2462|   201M|    bool unchecked_equals(const iterator& b) const { return slot_ == b.slot(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator4slotEv:
 2469|   201M|    slot_type* slot() const { return slot_; }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorptEv:
 2497|   194M|    pointer operator->() const { return inner_.operator->(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorptEv:
 2397|   194M|    pointer operator->() const {
 2398|   194M|      assert_is_full("operator->");
 2399|   194M|      return &operator*();
 2400|   194M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator14assert_is_fullEPKc:
 2445|   388M|    void assert_is_full(const char* operation) const {
 2446|   388M|      AssertIsFull(ctrl_, slot_, generation(), generation_ptr(), operation);
 2447|   388M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratordeEv:
 2391|   194M|    reference operator*() const {
 2392|   194M|      assert_is_full("operator*()");
 2393|   194M|      return unchecked_deref();
 2394|   194M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator15unchecked_derefEv:
 2466|   194M|    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|  63.7M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3241|  63.7M|    return const_cast<raw_hash_set*>(this)->find(key);
 3242|  63.7M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE4findIS8_EENSA_8iteratorERKT_:
 3225|  63.7M|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3226|  63.7M|    AssertOnFind(key);
 3227|  63.7M|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3227:9): [True: 0, False: 63.7M]
  ------------------
 3228|  63.7M|    prefetch_heap_block();
 3229|  63.7M|    return find_large(key);
 3230|  63.7M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE12AssertOnFindIS8_EEvRKT_:
 3725|  63.7M|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|  63.7M|    AssertHashEqConsistent(key);
 3727|  63.7M|    AssertNotDebugCapacity();
 3728|  63.7M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22AssertHashEqConsistentIS8_EEvRKT_:
 3736|  63.7M|  void AssertHashEqConsistent(const K& key) {
 3737|  63.7M|#ifdef NDEBUG
 3738|  63.7M|    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|  63.7M|                                             slot_type* slot) const {
 3503|  63.7M|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|  63.7M|                               PolicyTraits::element(slot));
 3505|  63.7M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE3endEv:
 2762|  63.7M|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2763|  63.7M|    AssertNotDebugCapacity();
 2764|  63.7M|    return iterator(common().generation_ptr());
 2765|  63.7M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorC2EPKh:
 2443|  63.7M|        : HashSetIteratorGenerationInfo(generation_ptr), slot_(nullptr) {}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE10find_largeIS8_EENSA_8iteratorERKT_:
 3393|  63.7M|  iterator find_large(const key_arg<K>& key) {
 3394|  63.7M|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  257|  63.7M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3395|  63.7M|    const size_t cap = common().capacity();
 3396|  63.7M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|  63.7M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3397|  63.7M|    const size_t hash = hash_of(key);
 3398|  63.7M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3399|  63.7M|    const h2_t h2 = H2(hash);
 3400|  63.7M|    ctrl_t* ctrl = control();
 3401|  63.7M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3402|  63.7M|    while (true) {
  ------------------
  |  Branch (3402:12): [True: 63.7M, Folded]
  ------------------
 3403|  63.7M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3404|  63.7M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3405|  63.7M|#endif
 3406|  63.7M|      Group g{ctrl + seq.offset()};
 3407|  63.7M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3407:23): [True: 63.7M, False: 0]
  ------------------
 3408|  63.7M|        const size_t offset = seq.offset(i);
 3409|  63.7M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array + offset)))
  ------------------
  |  |  191|  63.7M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 63.7M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 63.7M]
  |  |  |  Branch (191:57): [True: 63.7M, False: 0]
  |  |  ------------------
  ------------------
 3410|  63.7M|          return iterator_at_ptr(ctrl + offset, slot_array + offset);
 3411|  63.7M|      }
 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|  63.7M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7hash_ofIS8_EEmRKT_:
 3507|  63.7M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|  63.7M|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|  63.7M|                                               common().seed().seed()}(key);
 3510|  63.7M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE15iterator_at_ptrEPNS1_6ctrl_tEPv:
 3816|  63.7M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3817|  63.7M|    return {ctrl, to_slot(slot), common().generation_ptr()};
 3818|  63.7M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorC2ENSA_8iteratorE:
 2494|   127M|    const_iterator(iterator i) : inner_(std::move(i)) {}  // NOLINT
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE3endEv:
 2770|  63.7M|  const_iterator end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2771|  63.7M|    return const_cast<raw_hash_set*>(this)->end();
 2772|  63.7M|  }
_ZN4absl12lts_2026081718container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorESD_:
 2508|  63.7M|    friend bool operator!=(const const_iterator& a, const const_iterator& b) {
 2509|  63.7M|      return !(a == b);
 2510|  63.7M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorESD_:
 2505|  63.7M|    friend bool operator==(const const_iterator& a, const const_iterator& b) {
 2506|  63.7M|      return a.inner_ == b.inner_;
 2507|  63.7M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorESD_:
 2418|  63.7M|    friend bool operator==(const iterator& a, const iterator& b) {
 2419|  63.7M|      AssertIsValidForComparison(a.ctrl_, a.slot_, a.generation(),
 2420|  63.7M|                                 a.generation_ptr());
 2421|  63.7M|      AssertIsValidForComparison(b.ctrl_, b.slot_, b.generation(),
 2422|  63.7M|                                 b.generation_ptr());
 2423|  63.7M|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2424|  63.7M|                          a.generation_ptr(), b.generation_ptr());
 2425|  63.7M|      return a.unchecked_equals(b);
 2426|  63.7M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator16unchecked_equalsERKSB_:
 2462|  63.7M|    bool unchecked_equals(const iterator& b) const { return slot_ == b.slot(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator4slotEv:
 2469|  63.7M|    slot_type* slot() const { return slot_; }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorptEv:
 2497|  63.7M|    pointer operator->() const { return inner_.operator->(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorptEv:
 2397|  63.7M|    pointer operator->() const {
 2398|  63.7M|      assert_is_full("operator->");
 2399|  63.7M|      return &operator*();
 2400|  63.7M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator14assert_is_fullEPKc:
 2445|   127M|    void assert_is_full(const char* operation) const {
 2446|   127M|      AssertIsFull(ctrl_, slot_, generation(), generation_ptr(), operation);
 2447|   127M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratordeEv:
 2391|  63.7M|    reference operator*() const {
 2392|  63.7M|      assert_is_full("operator*()");
 2393|  63.7M|      return unchecked_deref();
 2394|  63.7M|    }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE4findIS9_EENSC_8iteratorERKT_:
 3225|   200M|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3226|   200M|    AssertOnFind(key);
 3227|   200M|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3227:9): [True: 14.9k, False: 200M]
  ------------------
 3228|   200M|    prefetch_heap_block();
 3229|   200M|    return find_large(key);
 3230|   200M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE12AssertOnFindIS9_EEvRKT_:
 3725|   400M|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|   400M|    AssertHashEqConsistent(key);
 3727|   400M|    AssertNotDebugCapacity();
 3728|   400M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE22AssertHashEqConsistentIS9_EEvRKT_:
 3736|   400M|  void AssertHashEqConsistent(const K& key) {
 3737|   400M|#ifdef NDEBUG
 3738|   400M|    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|   801M|  void AssertNotDebugCapacity() const { common().AssertNotDebugCapacity(); }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE6commonEv:
 3838|  2.89G|  const CommonFields& common() const { return settings_.template get<0>(); }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8is_smallEv:
 2312|   400M|  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|  14.9k|  ABSL_ATTRIBUTE_ALWAYS_INLINE iterator find_small(const key_arg<K>& key) {
 3388|  14.9k|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|  14.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3389|  14.9k|    return empty() || !equal_to(key, single_slot()) ? end() : single_iterator();
  ------------------
  |  Branch (3389:12): [True: 7.49k, False: 7.49k]
  |  Branch (3389:23): [True: 7.49k, False: 0]
  ------------------
 3390|  14.9k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE5emptyEv:
 2778|  29.9k|  bool empty() const { return !size(); }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE4sizeEv:
 2779|  29.9k|  size_t size() const {
 2780|  29.9k|    AssertNotDebugCapacity();
 2781|  29.9k|    const size_t size = common().size();
 2782|  29.9k|    [[maybe_unused]] const size_t kMaxValidSize = MaxValidSize();
 2783|  29.9k|    ABSL_ASSUME(size <= kMaxValidSize);
  ------------------
  |  |  272|  29.9k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2784|  29.9k|    return size;
 2785|  29.9k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8equal_toIS9_EEbRKT_PNS1_13map_slot_typeIS9_SA_EE:
 3502|  35.1M|                                             slot_type* slot) const {
 3503|  35.1M|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|  35.1M|                               PolicyTraits::element(slot));
 3505|  35.1M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE6eq_refEv:
 3892|  35.1M|  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|  14.9k|  slot_type* single_slot() {
 3863|  14.9k|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|  14.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3864|  14.9k|    return SooEnabled()
  ------------------
  |  Branch (3864:12): [Folded, False: 14.9k]
  ------------------
 3865|  14.9k|               ? soo_slot()
 3866|  14.9k|               : to_slot(common().slot_array(/*capacity=*/1));
 3867|  14.9k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7to_slotEPv:
 3519|   600M|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3520|   600M|    return static_cast<slot_type*>(buf);
 3521|   600M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE6commonEv:
 3837|  1.88G|  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|   200M|        : HashSetIteratorGenerationInfo(generation_ptr),
 2435|   200M|          ctrl_(ctrl),
 2436|   200M|          slot_(slot) {
 2437|       |      // This assumption helps the compiler know that any non-end iterator is
 2438|       |      // not equal to any end iterator.
 2439|   200M|      ABSL_ASSUME(slot != nullptr);
  ------------------
  |  |  272|   200M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2440|   200M|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE19prefetch_heap_blockEv:
 3830|   400M|  void prefetch_heap_block() const {
 3831|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   400M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3832|   400M|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3833|   400M|    __builtin_prefetch(control(), 0, 1);
 3834|   400M|#endif
 3835|   400M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7controlEv:
 3845|   801M|  ctrl_t* control() const {
 3846|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   801M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3847|   801M|    return common().control();
 3848|   801M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE10find_largeIS9_EENSC_8iteratorERKT_:
 3393|   200M|  iterator find_large(const key_arg<K>& key) {
 3394|   200M|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  257|   200M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3395|   200M|    const size_t cap = common().capacity();
 3396|   200M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   200M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3397|   200M|    const size_t hash = hash_of(key);
 3398|   200M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3399|   200M|    const h2_t h2 = H2(hash);
 3400|   200M|    ctrl_t* ctrl = control();
 3401|   200M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3402|   223M|    while (true) {
  ------------------
  |  Branch (3402:12): [True: 223M, Folded]
  ------------------
 3403|   223M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3404|   223M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3405|   223M|#endif
 3406|   223M|      Group g{ctrl + seq.offset()};
 3407|   223M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3407:23): [True: 17.6M, False: 223M]
  ------------------
 3408|  17.6M|        const size_t offset = seq.offset(i);
 3409|  17.6M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array + offset)))
  ------------------
  |  |  191|  17.6M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 194k, False: 17.4M]
  |  |  |  Branch (191:48): [Folded, False: 17.6M]
  |  |  |  Branch (191:57): [True: 194k, False: 17.4M]
  |  |  ------------------
  ------------------
 3410|   194k|          return iterator_at_ptr(ctrl + offset, slot_array + offset);
 3411|  17.6M|      }
 3412|   223M|      if (ABSL_PREDICT_TRUE(g.MaskEmpty())) return end();
  ------------------
  |  |  191|   223M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 200M, False: 23.5M]
  |  |  |  Branch (191:48): [Folded, False: 223M]
  |  |  |  Branch (191:57): [True: 200M, False: 23.5M]
  |  |  ------------------
  ------------------
 3413|  23.5M|      seq.next();
 3414|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= cap && "full table!");
  ------------------
  |  |  257|  23.5M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3415|  23.5M|    }
 3416|   200M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7hash_ofIS9_EEmRKT_:
 3507|   400M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|   400M|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|   400M|                                               common().seed().seed()}(key);
 3510|   400M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8hash_refEv:
 3890|   687M|  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|   194k|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3817|   194k|    return {ctrl, to_slot(slot), common().generation_ptr()};
 3818|   194k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorESF_:
 2427|   200M|    friend bool operator!=(const iterator& a, const iterator& b) {
 2428|   200M|      return !(a == b);
 2429|   200M|    }
unigram_model.cc:_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorESF_:
 2418|   200M|    friend bool operator==(const iterator& a, const iterator& b) {
 2419|   200M|      AssertIsValidForComparison(a.ctrl_, a.slot_, a.generation(),
 2420|   200M|                                 a.generation_ptr());
 2421|   200M|      AssertIsValidForComparison(b.ctrl_, b.slot_, b.generation(),
 2422|   200M|                                 b.generation_ptr());
 2423|   200M|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2424|   200M|                          a.generation_ptr(), b.generation_ptr());
 2425|   200M|      return a.unchecked_equals(b);
 2426|   200M|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iterator16unchecked_equalsERKSD_:
 2462|   200M|    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|   200M|    slot_type* slot() const { return slot_; }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE3endEv:
 2762|   400M|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2763|   400M|    AssertNotDebugCapacity();
 2764|   400M|    return iterator(common().generation_ptr());
 2765|   400M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorC2EPKh:
 2443|   400M|        : HashSetIteratorGenerationInfo(generation_ptr), slot_(nullptr) {}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorptEv:
 2397|   194k|    pointer operator->() const {
 2398|   194k|      assert_is_full("operator->");
 2399|   194k|      return &operator*();
 2400|   194k|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iterator14assert_is_fullEPKc:
 2445|   389k|    void assert_is_full(const char* operation) const {
 2446|   389k|      AssertIsFull(ctrl_, slot_, generation(), generation_ptr(), operation);
 2447|   389k|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratordeEv:
 2391|   194k|    reference operator*() const {
 2392|   194k|      assert_is_full("operator*()");
 2393|   194k|      return unchecked_deref();
 2394|   194k|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iterator15unchecked_derefEv:
 2466|   194k|    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|   200M|  {
 2869|   200M|    return emplace(std::move(value));
 2870|   200M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7emplaceIJNSt3__14pairIS9_SA_EEETnNSE_9enable_ifIXsr14IsDecomposableIDpT_EE5valueEiE4typeELi0EEENSF_INSC_8iteratorEbEEDpOSI_:
 2960|   200M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2961|   200M|    return PolicyTraits::apply(EmplaceDecomposable{*this},
 2962|   200M|                               std::forward<Args>(args)...);
 2963|   200M|  }
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|   200M|    std::pair<iterator, bool> operator()(const K& key, Args&&... args) const {
 3338|   200M|      auto res = s.find_or_prepare_insert(key);
 3339|   200M|      if (res.second) {
  ------------------
  |  Branch (3339:11): [True: 200M, False: 0]
  ------------------
 3340|   200M|        s.emplace_at(res.first, std::forward<Args>(args)...);
 3341|   200M|      }
 3342|   200M|      return {s.non_iterable_iterator_at_slot(res.first), res.second};
 3343|   200M|    }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE22find_or_prepare_insertIS9_EENSt3__14pairIPNS1_13map_slot_typeIS9_SA_EEbEERKT_:
 3777|   200M|  std::pair<slot_type*, bool> find_or_prepare_insert(const K& key) {
 3778|   200M|    AssertOnFind(key);
 3779|   200M|    return is_small() ? find_or_prepare_insert_small(key)
  ------------------
  |  Branch (3779:12): [True: 14.9k, False: 200M]
  ------------------
 3780|   200M|                      : find_or_prepare_insert_large(key);
 3781|   200M|  }
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|  14.9k|  find_or_prepare_insert_small(const K& key) {
 3661|  14.9k|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|  14.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3662|       |    if constexpr (SooEnabled()) {
 3663|       |      return find_or_prepare_insert_soo(key);
 3664|       |    }
 3665|  14.9k|    if (!empty()) {
  ------------------
  |  Branch (3665:9): [True: 7.49k, False: 7.49k]
  ------------------
 3666|  7.49k|      if (equal_to(key, single_slot())) {
  ------------------
  |  Branch (3666:11): [True: 0, False: 7.49k]
  ------------------
 3667|      0|        return {single_slot(), false};
 3668|      0|      }
 3669|  7.49k|    }
 3670|  14.9k|    return {to_slot(PrepareInsertSmallNonSoo(
 3671|  14.9k|                common(), GetPolicyFunctions(),
 3672|  14.9k|                HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})),
 3673|  14.9k|            true};
 3674|  14.9k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE18GetPolicyFunctionsEv:
 3988|   200M|  static const PolicyFunctions& GetPolicyFunctions() {
 3989|   200M|    static_assert(sizeof(slot_type) <= (std::numeric_limits<uint32_t>::max)(),
 3990|   200M|                  "Slot size is too large. Use std::unique_ptr for value type "
 3991|   200M|                  "or use absl::node_hash_{map,set}.");
 3992|   200M|    static_assert(alignof(slot_type) <=
 3993|   200M|                  size_t{(std::numeric_limits<uint16_t>::max)()});
 3994|   200M|    static_assert(sizeof(key_type) <=
 3995|   200M|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3996|   200M|    static_assert(sizeof(value_type) <=
 3997|   200M|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3998|   200M|    static constexpr size_t kBackingArrayAlignment =
 3999|   200M|        BackingArrayAlignment(alignof(slot_type));
 4000|   200M|    static constexpr PolicyFunctions value = {
 4001|   200M|        static_cast<uint32_t>(sizeof(key_type)),
 4002|   200M|        static_cast<uint32_t>(sizeof(value_type)),
 4003|   200M|        static_cast<uint32_t>(sizeof(slot_type)),
 4004|   200M|        static_cast<uint16_t>(alignof(slot_type)), SooEnabled(),
 4005|   200M|        ShouldSampleHashtablezInfoForAlloc<CharAlloc>(),
 4006|       |        // TODO(b/328722020): try to type erase
 4007|       |        // for standard layout and alignof(Hash) <= alignof(CommonFields).
 4008|   200M|        std::is_empty_v<hasher> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4008:9): [True: 0, Folded]
  ------------------
 4009|   200M|                                : &raw_hash_set::get_hash_ref_fn,
 4010|   200M|        PolicyTraits::template get_hash_slot_fn<hasher, kIsDefaultHash>(),
 4011|   200M|        PolicyTraits::transfer_uses_memcpy()
  ------------------
  |  Branch (4011:9): [True: 0, Folded]
  ------------------
 4012|   200M|            ? TransferNRelocatable<sizeof(slot_type)>
 4013|   200M|            : &raw_hash_set::transfer_n_slots_fn,
 4014|   200M|        std::is_empty_v<Alloc> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4014:9): [True: 0, Folded]
  ------------------
 4015|   200M|                               : &raw_hash_set::get_char_alloc_ref_fn,
 4016|   200M|        &AllocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 4017|   200M|        get_dealloc_backing_array_fn(),
 4018|   200M|        &raw_hash_set::transfer_unprobed_elements_to_next_capacity_fn};
 4019|   200M|    return value;
 4020|   200M|  }
_ZN4absl12lts_2026081718container_internal20TransferNRelocatableILm16EEEvPvS3_S3_m:
 2151|   148k|                                                  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|   148k|  memcpy(dst, src, SizeOfSlot * count);
 2155|   148k|}
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|  79.7k|                                    size_t source_offset, size_t h1)) {
 3936|  79.7k|    const size_t new_capacity = common.capacity();
 3937|  79.7k|    ABSL_ASSUME(new_capacity > kMaxSmallCapacity);
  ------------------
  |  |  272|  79.7k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3938|  79.7k|    const size_t old_capacity = PreviousCapacity(new_capacity);
 3939|  79.7k|    ABSL_ASSUME(old_capacity + 1 >= Group::kWidth);
  ------------------
  |  |  272|  79.7k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3940|  79.7k|    ABSL_ASSUME((old_capacity + 1) % Group::kWidth == 0);
  ------------------
  |  |  272|  79.7k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3941|       |
 3942|  79.7k|    auto* set = reinterpret_cast<raw_hash_set*>(&common);
 3943|  79.7k|    slot_type* old_slots_ptr = to_slot(old_slots);
 3944|  79.7k|    ctrl_t* new_ctrl = common.control();
 3945|  79.7k|    slot_type* new_slots = set->slot_array(new_capacity);
 3946|       |
 3947|  20.6M|    for (size_t group_index = 0; group_index < old_capacity;
  ------------------
  |  Branch (3947:34): [True: 20.5M, False: 79.7k]
  ------------------
 3948|  20.5M|         group_index += Group::kWidth) {
 3949|  20.5M|      GroupFullEmptyOrDeleted old_g(old_ctrl + group_index);
 3950|  20.5M|      std::memset(new_ctrl + group_index, static_cast<int8_t>(ctrl_t::kEmpty),
 3951|  20.5M|                  Group::kWidth);
 3952|  20.5M|      std::memset(new_ctrl + group_index + old_capacity + 1,
 3953|  20.5M|                  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|   287M|      for (auto in_fixed_group_index : old_g.MaskFull()) {
  ------------------
  |  Branch (3956:38): [True: 287M, False: 20.5M]
  ------------------
 3957|   287M|        size_t old_index = group_index + in_fixed_group_index;
 3958|   287M|        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|   287M|        size_t hash = set->hash_of(old_slot);
 3962|   287M|        size_t h1 = H1(hash);
 3963|   287M|        h2_t h2 = H2(hash);
 3964|   287M|        size_t new_index = TryFindNewIndexWithoutProbing(
 3965|   287M|            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|   287M|        if (ABSL_PREDICT_FALSE(new_index == kProbedElementIndexSentinel)) {
  ------------------
  |  |  190|   287M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 126k, False: 287M]
  |  |  |  Branch (190:49): [Folded, False: 287M]
  |  |  |  Branch (190:58): [True: 126k, False: 287M]
  |  |  ------------------
  ------------------
 3969|   126k|          encode_probed_element(probed_storage, h2, old_index, h1);
 3970|   126k|          continue;
 3971|   126k|        }
 3972|   287M|        ABSL_SWISSTABLE_ASSERT((new_index & old_capacity) <= old_index);
  ------------------
  |  |  257|   287M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3973|       |        ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_index]));
  ------------------
  |  |  257|   287M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3974|   287M|        new_ctrl[new_index] = static_cast<ctrl_t>(h2);
 3975|   287M|        auto* new_slot = new_slots + new_index;
 3976|   287M|        SanitizerUnpoisonMemoryRegion(new_slot, sizeof(slot_type));
 3977|   287M|        set->transfer(new_slot, old_slot);
 3978|   287M|        SanitizerPoisonMemoryRegion(old_slot, sizeof(slot_type));
 3979|   287M|      }
 3980|  20.5M|    }
 3981|  79.7k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE10slot_arrayEm:
 3849|  79.7k|  slot_type* slot_array(size_t capacity) const {
 3850|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|  79.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3851|  79.7k|    return static_cast<slot_type*>(common().slot_array(capacity));
 3852|  79.7k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7hash_ofEPNS1_13map_slot_typeIS9_SA_EE:
 3511|   287M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(slot_type* slot) const {
 3512|   287M|    return PolicyTraits::apply(
 3513|   287M|        HashElement<hasher, kIsDefaultHash>{hash_ref(), common().seed().seed()},
 3514|   287M|        PolicyTraits::element(slot));
 3515|   287M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8transferEPNS1_13map_slot_typeIS9_SA_EESF_:
 3377|   287M|  void transfer(slot_type* to, slot_type* from) {
 3378|   287M|    common().RunWithReentrancyGuard([&] {
 3379|   287M|      allocator_type alloc(char_alloc_ref());
 3380|   287M|      PolicyTraits::transfer(&alloc, to, from);
 3381|   287M|    });
 3382|   287M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS9_EEJEE8transferEPNS1_13map_slot_typeISB_SC_EESH_EUlvE_EEvT_:
 1486|   287M|  void RunWithReentrancyGuard(F f) {
 1487|   287M|#ifdef NDEBUG
 1488|   287M|    f();
 1489|   287M|    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|   287M|    common().RunWithReentrancyGuard([&] {
 3379|   287M|      allocator_type alloc(char_alloc_ref());
 3380|   287M|      PolicyTraits::transfer(&alloc, to, from);
 3381|   287M|    });
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE14char_alloc_refEv:
 3893|   487M|  CharAlloc& char_alloc_ref() { return settings_.template get<3>(); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8hash_refEv:
 3889|  14.9k|  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|   200M|  std::pair<slot_type*, bool> find_or_prepare_insert_large(const K& key) {
 3678|   200M|    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   200M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3679|   200M|    prefetch_heap_block();
 3680|   200M|    const size_t cap = capacity();
 3681|   200M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   200M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3682|   200M|    const size_t hash = hash_of(key);
 3683|   200M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3684|   200M|    const h2_t h2 = H2(hash);
 3685|   200M|    const ctrl_t* ctrl = control();
 3686|   200M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3687|   223M|    while (true) {
  ------------------
  |  Branch (3687:12): [True: 223M, Folded]
  ------------------
 3688|   223M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3689|   223M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3690|   223M|#endif
 3691|   223M|      Group g{ctrl + seq.offset()};
 3692|   223M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3692:23): [True: 17.4M, False: 223M]
  ------------------
 3693|  17.4M|        slot_type* slot = slot_array + seq.offset(i);
 3694|  17.4M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot))) {
  ------------------
  |  |  191|  17.4M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 17.4M]
  |  |  |  Branch (191:48): [Folded, False: 17.4M]
  |  |  |  Branch (191:57): [True: 0, False: 17.4M]
  |  |  ------------------
  ------------------
 3695|      0|          return {slot, false};
 3696|      0|        }
 3697|  17.4M|      }
 3698|   223M|      auto mask_empty = g.MaskEmpty();
 3699|   223M|      if (ABSL_PREDICT_TRUE(mask_empty)) {
  ------------------
  |  |  191|   223M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 200M, False: 23.5M]
  |  |  |  Branch (191:48): [Folded, False: 223M]
  |  |  |  Branch (191:57): [True: 200M, False: 23.5M]
  |  |  ------------------
  ------------------
 3700|   200M|        size_t target_group_offset = seq.offset();
 3701|   200M|        void* slot =
 3702|   200M|            SwisstableGenerationsEnabled()
  ------------------
  |  Branch (3702:13): [Folded, False: 200M]
  ------------------
 3703|   200M|                ? 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|   200M|                : PrepareInsertLarge(
 3708|   200M|                      common(), GetPolicyFunctions(), hash, mask_empty,
 3709|   200M|                      FindInfo{target_group_offset, seq.index()});
 3710|   200M|        return {to_slot(slot), true};
 3711|   200M|      }
 3712|  23.5M|      seq.next();
 3713|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  257|  23.5M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3714|  23.5M|    }
 3715|   200M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8capacityEv:
 2786|   200M|  size_t capacity() const {
 2787|   200M|    const size_t cap = common().capacity();
 2788|       |    // Compiler complains when using functions in ASSUME so use local variables.
 2789|   200M|    [[maybe_unused]] const bool kIsValid = IsValidCapacity(cap);
 2790|   200M|    [[maybe_unused]] const size_t kDefaultCapacity = DefaultCapacity();
 2791|   200M|    [[maybe_unused]] const size_t kMaxValidCapacity = MaxValidCapacity();
 2792|   200M|    ABSL_ASSUME(kIsValid || cap == 0);
  ------------------
  |  |  272|   200M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (272:44): [True: 200M, False: 0]
  |  |  |  Branch (272:44): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 2793|   200M|    ABSL_ASSUME(cap >= kDefaultCapacity);
  ------------------
  |  |  272|   200M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2794|   200M|    ABSL_ASSUME(cap <= kMaxValidCapacity);
  ------------------
  |  |  272|   200M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2795|   200M|    return cap;
 2796|   200M|  }
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|   200M|  void emplace_at(slot_type* slot, Args&&... args) {
 3793|   200M|    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|   200M|            PolicyTraits::apply(FindElement{*this}, PolicyTraits::element(slot))
 3799|   200M|                    .slot() == slot) &&
 3800|   200M|           "constructed value does not match the lookup key");
 3801|   200M|  }
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|   200M|  void construct(slot_type* slot, Args&&... args) {
 3366|   200M|    common().RunWithReentrancyGuard([&] {
 3367|   200M|      allocator_type alloc(char_alloc_ref());
 3368|   200M|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|   200M|    });
 3370|   200M|  }
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|   200M|  void RunWithReentrancyGuard(F f) {
 1487|   200M|#ifdef NDEBUG
 1488|   200M|    f();
 1489|   200M|    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|   200M|    common().RunWithReentrancyGuard([&] {
 3367|   200M|      allocator_type alloc(char_alloc_ref());
 3368|   200M|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|   200M|    });
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE29non_iterable_iterator_at_slotEPNS1_13map_slot_typeIS9_SA_EE:
 3806|   200M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3807|   200M|    return {InsertIteratorControl(), slot, common().generation_ptr()};
 3808|   200M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEED2Ev:
 2746|  7.49k|  ~raw_hash_set() {
 2747|  7.49k|    destructor_impl();
 2748|       |    if constexpr (SwisstableGenerationsOrDebugEnabled()) {
 2749|       |      common().set_capacity(HashtableCapacity::CreateDestroyed());
 2750|       |    }
 2751|  7.49k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE15destructor_implEv:
 3457|  7.49k|  void destructor_impl() {
 3458|  7.49k|    if (SwisstableGenerationsEnabled() &&
  ------------------
  |  Branch (3458:9): [Folded, False: 7.49k]
  |  Branch (3458:9): [Folded, False: 7.49k]
  ------------------
 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|  7.49k|    } else {
 3471|  7.49k|      if (capacity() == 0) return;
  ------------------
  |  Branch (3471:11): [True: 0, False: 7.49k]
  ------------------
 3472|  7.49k|      DestructNonSoo(common(), sizeof(slot_type), alignof(slot_type),
 3473|  7.49k|                     get_destroy_slot_fn(), get_dealloc_backing_array_fn(),
 3474|  7.49k|                     &char_alloc_ref());
 3475|  7.49k|    }
 3476|  7.49k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE19get_destroy_slot_fnEv:
 3922|  7.49k|  static constexpr DestroySlotFn get_destroy_slot_fn() {
 3923|  7.49k|    return PolicyTraits::template destroy_is_trivial<Alloc>()
  ------------------
  |  Branch (3923:12): [True: 7.49k, Folded]
  ------------------
 3924|  7.49k|               ? nullptr
 3925|  7.49k|               : &raw_hash_set::destroy_slot_fn_impl;
 3926|  7.49k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE28get_dealloc_backing_array_fnEv:
 3983|  7.49k|  static constexpr DeallocBackingArrayFn get_dealloc_backing_array_fn() {
 3984|  7.49k|    return &DeallocateBackingArray<BackingArrayAlignment(alignof(slot_type)),
 3985|  7.49k|                                   CharAlloc>;
 3986|  7.49k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEEC2Ev:
 2534|  7.49k|      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|   109k|void* AllocateBackingArray(void* alloc, size_t n) {
 1901|   109k|  return Allocate<AlignOfBackingArray>(static_cast<Alloc*>(alloc), n);
 1902|   109k|}
_ZN4absl12lts_2026081718container_internal22DeallocateBackingArrayILm8ENSt3__19allocatorIcEEEEvPvmPNS1_6ctrl_tEmmbm:
 1907|   109k|                            size_t blocked_element_count) {
 1908|   109k|  RawHashSetLayout layout(capacity, slot_size, slot_align, had_infoz,
 1909|   109k|                          blocked_element_count);
 1910|   109k|  void* backing_array = ctrl - layout.control_offset();
 1911|       |  // Unpoison before returning the memory to the allocator.
 1912|   109k|  SanitizerUnpoisonMemoryRegion(backing_array, layout.alloc_size());
 1913|   109k|  Deallocate<AlignOfBackingArray>(static_cast<Alloc*>(alloc), backing_array,
 1914|   109k|                                  layout.alloc_size());
 1915|   109k|}

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

_ZNK4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEclES5_S7_:
  164|   150M|  R operator()(Args... args) const {
  165|   150M|    return invoker_(ptr_, std::forward<Args>(args)...);
  166|   150M|  }
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlS5_S7_E_vEEOT_:
  112|   150M|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlS5_S7_E_EENSt3__110in_place_tEOT_:
  100|   150M|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|   150M|    absl::functional_internal::AssertNonNull(f);
  102|   150M|    ptr_.obj = &f;
  103|   150M|  }
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlS5_S7_E_vEEOT_:
  112|  8.29k|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlS5_S7_E_EENSt3__110in_place_tEOT_:
  100|  8.29k|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|  8.29k|    absl::functional_internal::AssertNonNull(f);
  102|  8.29k|    ptr_.obj = &f;
  103|  8.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|  14.9k|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
unigram_model.cc:_ZN4absl12lts_2026081711FunctionRefIFmmEEC2INS0_18container_internal7HashKeyINS5_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashESD_Lb0EEEEENSt3__110in_place_tEOT_:
  100|  14.9k|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|  14.9k|    absl::functional_internal::AssertNonNull(f);
  102|  14.9k|    ptr_.obj = &f;
  103|  14.9k|  }
_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|  7.50k|  R operator()(Args... args) const {
  165|  7.50k|    return invoker_(ptr_, std::forward<Args>(args)...);
  166|  7.50k|  }

_ZN4absl12lts_2026081719functional_internal12InvokeObjectIRZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_vJSB_SD_EEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   72|   150M|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|   150M|  using T = std::remove_reference_t<Obj>;
   74|   150M|  return static_cast<R>(std::invoke(
   75|   150M|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|   150M|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|   150M|}
_ZN4absl12lts_2026081719functional_internal13AssertNonNullIZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_EEvRKT_:
  134|   150M|void AssertNonNull(const F&) {}
_ZN4absl12lts_2026081719functional_internal12InvokeObjectIRZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_vJSB_SD_EEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   72|  8.29k|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|  8.29k|  using T = std::remove_reference_t<Obj>;
   74|  8.29k|  return static_cast<R>(std::invoke(
   75|  8.29k|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|  8.29k|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|  8.29k|}
_ZN4absl12lts_2026081719functional_internal13AssertNonNullIZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_EEvRKT_:
  134|  8.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|  7.49k|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|  7.49k|  using T = std::remove_reference_t<Obj>;
   74|  7.49k|  return static_cast<R>(std::invoke(
   75|  7.49k|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|  7.49k|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|  7.49k|}
unigram_model.cc:_ZN4absl12lts_2026081719functional_internal13AssertNonNullINS0_18container_internal7HashKeyINS3_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashESB_Lb0EEEEEvRKT_:
  134|  14.9k|void AssertNonNull(const F&) {}

_ZN4absl12lts_2026081713hash_internal43CombineLargeContiguousImplOn64BitLengthGt32EmPKhm:
  417|  1.30k|                                                     size_t len) {
  418|  1.30k|  assert(len > 32);
  419|  1.30k|  assert(sizeof(size_t) == 8);  // NOLINT(misc-static-assert)
  420|  1.30k|  if (ABSL_PREDICT_TRUE(len <= PiecewiseChunkSize())) {
  ------------------
  |  |  191|  1.30k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 899, False: 410]
  |  |  |  Branch (191:48): [Folded, False: 1.30k]
  |  |  |  Branch (191:57): [True: 899, False: 410]
  |  |  ------------------
  ------------------
  421|    899|    return HashBlockOn64Bit(state, first, len);
  422|    899|  }
  423|    410|  return SplitAndCombineOn64Bit(state, first, len);
  424|  1.30k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_116HashBlockOn64BitEmPKhm:
  376|  27.9k|    uint64_t state, const unsigned char* data, size_t len) {
  377|  27.9k|#ifdef ABSL_HAVE_INTRINSIC_INT128
  378|  27.9k|  return LowLevelHashLenGt32(state, data, len);
  379|       |#else
  380|       |  return hash_internal::CityHash64WithSeed(reinterpret_cast<const char*>(data),
  381|       |                                           len, state);
  382|       |#endif
  383|  27.9k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_119LowLevelHashLenGt32EmPKvm:
  341|  27.9k|                                              size_t len) {
  342|  27.9k|  assert(len > 32);
  343|  27.9k|  if (ABSL_PREDICT_FALSE(len > 64)) {
  ------------------
  |  |  190|  27.9k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 27.8k, False: 109]
  |  |  |  Branch (190:49): [Folded, False: 27.9k]
  |  |  |  Branch (190:58): [True: 27.8k, False: 109]
  |  |  ------------------
  ------------------
  344|  27.8k|    return LowLevelHashLenGt64(seed, data, len);
  345|  27.8k|  }
  346|    109|  return LowLevelHash33To64(seed, static_cast<const uint8_t*>(data), len);
  347|  27.9k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_119LowLevelHashLenGt64EmPKvm:
  291|  27.8k|LowLevelHashLenGt64(uint64_t seed, const void* data, size_t len) {
  292|  27.8k|  assert(len > 64);
  293|  27.8k|  const uint8_t* ptr = static_cast<const uint8_t*>(data);
  294|  27.8k|  uint64_t current_state = seed ^ kStaticRandomData[0] ^ len;
  295|  27.8k|  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|  27.8k|  uint64_t duplicated_state0 = current_state;
  300|  27.8k|  uint64_t duplicated_state1 = current_state;
  301|  27.8k|  uint64_t duplicated_state2 = current_state;
  302|       |
  303|   410k|  do {
  304|   410k|    PrefetchFutureDataToLocalCache(ptr);
  305|       |
  306|   410k|    uint64_t a = absl::base_internal::UnalignedLoad64(ptr);
  307|   410k|    uint64_t b = absl::base_internal::UnalignedLoad64(ptr + 8);
  308|   410k|    uint64_t c = absl::base_internal::UnalignedLoad64(ptr + 16);
  309|   410k|    uint64_t d = absl::base_internal::UnalignedLoad64(ptr + 24);
  310|   410k|    uint64_t e = absl::base_internal::UnalignedLoad64(ptr + 32);
  311|   410k|    uint64_t f = absl::base_internal::UnalignedLoad64(ptr + 40);
  312|   410k|    uint64_t g = absl::base_internal::UnalignedLoad64(ptr + 48);
  313|   410k|    uint64_t h = absl::base_internal::UnalignedLoad64(ptr + 56);
  314|       |
  315|   410k|    current_state = Mix(a ^ kStaticRandomData[1], b ^ current_state);
  316|   410k|    duplicated_state0 = Mix(c ^ kStaticRandomData[2], d ^ duplicated_state0);
  317|       |
  318|   410k|    duplicated_state1 = Mix(e ^ kStaticRandomData[3], f ^ duplicated_state1);
  319|   410k|    duplicated_state2 = Mix(g ^ kStaticRandomData[4], h ^ duplicated_state2);
  320|       |
  321|   410k|    ptr += 64;
  322|   410k|    len -= 64;
  323|   410k|  } while (len > 64);
  ------------------
  |  Branch (323:12): [True: 383k, False: 27.8k]
  ------------------
  324|       |
  325|  27.8k|  current_state = (current_state ^ duplicated_state0) ^
  326|  27.8k|                  (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|  27.8k|  if (len > 32) {
  ------------------
  |  Branch (329:7): [True: 27.4k, False: 327]
  ------------------
  330|  27.4k|    current_state = Mix32Bytes(ptr, current_state);
  331|  27.4k|  }
  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|  27.8k|  return Mix32Bytes(last_32_ptr, current_state);
  337|  27.8k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_130PrefetchFutureDataToLocalCacheEPKh:
   55|   410k|void PrefetchFutureDataToLocalCache(const uint8_t* ptr) {
   56|   410k|  PrefetchToLocalCache(ptr + 5 * ABSL_CACHELINE_SIZE);
  ------------------
  |  |   89|   410k|#define ABSL_CACHELINE_SIZE 64
  ------------------
   57|   410k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_110Mix32BytesEPKhm:
  271|  55.5k|uint64_t Mix32Bytes(const uint8_t* ptr, uint64_t current_state) {
  272|  55.5k|  uint64_t a = absl::base_internal::UnalignedLoad64(ptr);
  273|  55.5k|  uint64_t b = absl::base_internal::UnalignedLoad64(ptr + 8);
  274|  55.5k|  uint64_t c = absl::base_internal::UnalignedLoad64(ptr + 16);
  275|  55.5k|  uint64_t d = absl::base_internal::UnalignedLoad64(ptr + 24);
  276|       |
  277|  55.5k|  uint64_t cs0 = Mix(a ^ kStaticRandomData[1], b ^ current_state);
  278|  55.5k|  uint64_t cs1 = Mix(c ^ kStaticRandomData[2], d ^ current_state);
  279|  55.5k|  return cs0 ^ cs1;
  280|  55.5k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_118LowLevelHash33To64EmPKhm:
  282|    109|uint64_t LowLevelHash33To64(uint64_t seed, const uint8_t* ptr, size_t len) {
  283|    109|  assert(len > 32);
  284|       |  assert(len <= 64);
  285|    109|  uint64_t current_state = seed ^ kStaticRandomData[0] ^ len;
  286|    109|  const uint8_t* last_32_ptr = ptr + len - 32;
  287|    109|  return Mix32Bytes(last_32_ptr, Mix32Bytes(ptr, current_state));
  288|    109|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_122SplitAndCombineOn64BitEmPKhm:
  386|    410|SplitAndCombineOn64Bit(uint64_t state, const unsigned char* first, size_t len) {
  387|  27.4k|  while (len >= PiecewiseChunkSize()) {
  ------------------
  |  Branch (387:10): [True: 27.0k, False: 410]
  ------------------
  388|  27.0k|    state = HashBlockOn64Bit(state, first, PiecewiseChunkSize());
  389|  27.0k|    len -= PiecewiseChunkSize();
  390|  27.0k|    first += PiecewiseChunkSize();
  391|  27.0k|  }
  392|       |  // Do not call CombineContiguousImpl for empty range since it is modifying
  393|       |  // state.
  394|    410|  if (len == 0) {
  ------------------
  |  Branch (394:7): [True: 10, False: 400]
  ------------------
  395|     10|    return state;
  396|     10|  }
  397|       |  // Handle the remainder.
  398|    400|  return CombineContiguousImpl(state, first, len,
  399|    400|                               std::integral_constant<int, 8>{});
  400|    410|}

_ZN4absl12lts_2026081713hash_internal15MixingHashState18combine_contiguousES2_PKhm:
 1449|   265M|                                            size_t size) {
 1450|   265M|    return MixingHashState(
 1451|   265M|        CombineContiguousImpl(hash_state.state_, first, size,
 1452|   265M|                              std::integral_constant<int, sizeof(size_t)>{}));
 1453|   265M|  }
_ZN4absl12lts_2026081713hash_internal15MixingHashStateC2Em:
 1500|  1.90G|  explicit MixingHashState(uint64_t state) : state_(state) {}
_ZN4absl12lts_2026081713hash_internal15MixingHashState11combine_rawES2_m:
 1506|   687M|                                     uint64_t value) {
 1507|   687M|    return MixingHashState(CombineRawImpl(hash_state.state_, value));
 1508|   687M|  }
_ZN4absl12lts_2026081713hash_internal15MixingHashState4SeedEv:
 1552|   687M|  ABSL_ATTRIBUTE_ALWAYS_INLINE static size_t Seed() {
 1553|   687M|#if (!defined(__clang__) || __clang_major__ > 11) && \
 1554|   687M|    (!defined(__apple_build_version__) ||            \
 1555|   687M|     __apple_build_version__ >= 19558921)  // Xcode 12
 1556|   687M|    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|   687M|  }
_ZN4absl12lts_2026081713hash_internal18PiecewiseChunkSizeEv:
  157|   109k|constexpr size_t PiecewiseChunkSize() { return 1024; }
_ZN4absl12lts_2026081713hash_internal19PrecombineLengthMixEmm:
 1056|   265M|inline uint64_t PrecombineLengthMix(uint64_t state, size_t len) {
 1057|   265M|  ABSL_ASSUME(len + sizeof(uint64_t) <= sizeof(kStaticRandomData));
  ------------------
  |  |  272|   265M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1058|   265M|  uint64_t data = absl::base_internal::UnalignedLoad64(
 1059|   265M|      reinterpret_cast<const unsigned char*>(&kStaticRandomData[0]) + len);
 1060|   265M|  return state ^ data;
 1061|   265M|}
_ZN4absl12lts_2026081713hash_internal3MixEmm:
 1063|   955M|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|   955M|  absl::uint128 m = lhs;
 1067|   955M|  m *= rhs;
 1068|   955M|  return Uint128High64(m) ^ Uint128Low64(m);
 1069|   955M|}
_ZN4absl12lts_2026081713hash_internal5Read8EPKh:
 1079|    756|inline uint64_t Read8(const unsigned char* p) {
 1080|    756|  return absl::base_internal::UnalignedLoad64(p);
 1081|    756|}
_ZN4absl12lts_2026081713hash_internal9Read9To16EPKhm:
 1090|    108|                                               size_t len) {
 1091|    108|  return {Read8(p), Read8(p + len - 8)};
 1092|    108|}
_ZN4absl12lts_2026081713hash_internal8Read4To8EPKhm:
 1096|   257M|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|   257M|  uint64_t most_significant =
 1109|   257M|      static_cast<uint64_t>(absl::base_internal::UnalignedLoad32(p)) << 32;
 1110|   257M|  uint64_t least_significant =
 1111|   257M|      absl::base_internal::UnalignedLoad32(p + len - 4);
 1112|   257M|  return most_significant | least_significant;
 1113|   257M|}
_ZN4absl12lts_2026081713hash_internal8Read1To3EPKhm:
 1116|  7.72M|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|  7.72M|  uint32_t mem0 = (static_cast<uint32_t>(p[0]) << 16) | p[len - 1];
 1126|  7.72M|  uint32_t mem1 = static_cast<uint32_t>(p[len / 2]) << 8;
 1127|  7.72M|  return mem0 | mem1;
 1128|  7.72M|}
_ZN4absl12lts_2026081713hash_internal14CombineRawImplEmm:
 1171|   953M|                                                            uint64_t value) {
 1172|   953M|  return Mix(state ^ value, kMul);
 1173|   953M|}
_ZN4absl12lts_2026081713hash_internal26CombineSmallContiguousImplEmPKhm:
 1187|   265M|    uint64_t state, const unsigned char* first, size_t len) {
 1188|   265M|  ABSL_ASSUME(len <= 8);
  ------------------
  |  |  272|   265M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1189|   265M|  uint64_t v;
 1190|   265M|  if (len >= 4) {
  ------------------
  |  Branch (1190:7): [True: 257M, False: 7.72M]
  ------------------
 1191|   257M|    v = Read4To8(first, len);
 1192|   257M|  } else if (len > 0) {
  ------------------
  |  Branch (1192:14): [True: 7.72M, False: 0]
  ------------------
 1193|  7.72M|    v = Read1To3(first, len);
 1194|  7.72M|  } else {
 1195|       |    // Empty string must modify the state.
 1196|      0|    v = 0x57;
 1197|      0|  }
 1198|   265M|  return CombineRawImpl(state, v);
 1199|   265M|}
_ZN4absl12lts_2026081713hash_internal26CombineContiguousImpl9to16EmPKhm:
 1202|    108|    uint64_t state, const unsigned char* first, size_t len) {
 1203|    108|  ABSL_ASSUME(len >= 9);
  ------------------
  |  |  272|    108|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1204|    108|  ABSL_ASSUME(len <= 16);
  ------------------
  |  |  272|    108|#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|    108|  auto p = Read9To16(first, len);
 1211|    108|  return Mix(state ^ p.first, kMul ^ p.second);
 1212|    108|}
_ZN4absl12lts_2026081713hash_internal27CombineContiguousImpl17to32EmPKhm:
 1215|    135|    uint64_t state, const unsigned char* first, size_t len) {
 1216|    135|  ABSL_ASSUME(len >= 17);
  ------------------
  |  |  272|    135|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1217|    135|  ABSL_ASSUME(len <= 32);
  ------------------
  |  |  272|    135|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1218|       |  // Do two mixes of overlapping 16-byte ranges in parallel to minimize
 1219|       |  // latency.
 1220|    135|  const uint64_t m0 =
 1221|    135|      Mix(Read8(first) ^ kStaticRandomData[1], Read8(first + 8) ^ state);
 1222|       |
 1223|    135|  const unsigned char* tail_16b_ptr = first + (len - 16);
 1224|    135|  const uint64_t m1 = Mix(Read8(tail_16b_ptr) ^ kStaticRandomData[3],
 1225|    135|                          Read8(tail_16b_ptr + 8) ^ state);
 1226|    135|  return m0 ^ m1;
 1227|    135|}
_ZN4absl12lts_2026081713hash_internal21CombineContiguousImplEmPKhmNSt3__117integral_constantIiLi8EEE:
 1311|   265M|    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|   265M|  if (len <= 8) {
  ------------------
  |  Branch (1314:7): [True: 265M, False: 1.55k]
  ------------------
 1315|   265M|    return CombineSmallContiguousImpl(PrecombineLengthMix(state, len), first,
 1316|   265M|                                      len);
 1317|   265M|  }
 1318|  1.55k|  if (len <= 16) {
  ------------------
  |  Branch (1318:7): [True: 108, False: 1.44k]
  ------------------
 1319|    108|    return CombineContiguousImpl9to16(PrecombineLengthMix(state, len), first,
 1320|    108|                                      len);
 1321|    108|  }
 1322|  1.44k|  if (len <= 32) {
  ------------------
  |  Branch (1322:7): [True: 135, False: 1.30k]
  ------------------
 1323|    135|    return CombineContiguousImpl17to32(PrecombineLengthMix(state, len), first,
 1324|    135|                                       len);
 1325|    135|  }
 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.30k|  return CombineLargeContiguousImplOn64BitLengthGt32(state, first, len);
 1330|  1.44k|}
_ZN4absl12lts_2026081713hash_internal15MixingHashState14hash_with_seedINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEETnNS4_9enable_ifIXntsr16IntegralFastPathIT_EE5valueEiE4typeELi0EEEmRKSA_m:
 1473|   265M|  static size_t hash_with_seed(const T& value, size_t seed) {
 1474|   265M|    return static_cast<size_t>(combine(MixingHashState{seed}, value).state_);
 1475|   265M|  }
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJEEES3_S3_RKT_DpRKT0_:
 1598|   265M|H HashStateBase<H>::combine(H state, const T& value, const Ts&... values) {
 1599|   265M|  return H::combine(hash_internal::HashSelect::template Apply<T>::Invoke(
 1600|   265M|                        std::move(state), value),
 1601|   265M|                    values...);
 1602|   265M|}
_ZN4absl12lts_2026081713hash_internal10HashSelect14HashValueProbe6InvokeINS1_15MixingHashStateENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEENS6_9enable_ifIXsr3stdE9is_same_vIT_DTcl13AbslHashValueclsr3stdE4movefp_Efp0_EEEESC_E4typeESC_RKT0_:
 1376|   265M|        H> {
 1377|   265M|      return AbslHashValue(std::move(state), value);
 1378|   265M|    }
_ZN4absl12lts_2026081713hash_internal13AbslHashValueINS1_15MixingHashStateEEET_S4_NSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE:
  659|   265M|H AbslHashValue(H hash_state, absl::string_view str) {
  660|   265M|  return H::combine_contiguous(std::move(hash_state), str.data(), str.size());
  661|   265M|}
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE18combine_contiguousIcEES3_S3_PKT_m:
 1606|   265M|H HashStateBase<H>::combine_contiguous(H state, const T* data, size_t size) {
 1607|   265M|  return hash_internal::hash_range_or_bytes(std::move(state), data, size);
 1608|   265M|}
_ZN4absl12lts_2026081713hash_internal19hash_range_or_bytesINS1_15MixingHashStateEcEENSt3__19enable_ifIXsr23is_uniquely_representedIT0_EE5valueET_E4typeES7_PKS6_m:
 1029|   265M|    H hash_state, const T* data, size_t size) {
 1030|   265M|  const auto* bytes = reinterpret_cast<const unsigned char*>(data);
 1031|   265M|  return H::combine_contiguous(std::move(hash_state), bytes, sizeof(T) * size);
 1032|   265M|}
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineES3_:
  299|  1.64G|  static H combine(H state) { return state; }
_ZNK4absl12lts_2026081713hash_internal12HashWithSeed4hashINS1_4HashINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEEES9_EEmRKT_RKT0_m:
  412|   265M|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|   265M|    return hasher.hash_with_seed(value, seed);
  415|   265M|  }
_ZNK4absl12lts_2026081713hash_internal8HashImplINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEE14hash_with_seedERKS7_m:
 1587|   265M|  size_t hash_with_seed(const T& value, size_t seed) const {
 1588|   265M|    return MixingHashState::hash_with_seed(value, seed);
 1589|   265M|  }
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineImJEEES3_S3_RKT_DpRKT0_:
 1598|   687M|H HashStateBase<H>::combine(H state, const T& value, const Ts&... values) {
 1599|   687M|  return H::combine(hash_internal::HashSelect::template Apply<T>::Invoke(
 1600|   687M|                        std::move(state), value),
 1601|   687M|                    values...);
 1602|   687M|}
_ZN4absl12lts_2026081713hash_internal10HashSelect24UniquelyRepresentedProbe6InvokeINS1_15MixingHashStateEmEENSt3__19enable_ifIXsr23is_uniquely_representedIT0_EE5valueET_E4typeES9_RKS8_:
 1367|   687M|        -> std::enable_if_t<is_uniquely_represented<T>::value, H> {
 1368|   687M|      return hash_internal::hash_bytes(std::move(state), value);
 1369|   687M|    }
_ZN4absl12lts_2026081713hash_internal10hash_bytesINS1_15MixingHashStateEmTnNSt3__19enable_ifIXsr12FitsIn64BitsIT0_EE5valueEiE4typeELi0EEET_S9_RKS6_:
  422|   687M|H hash_bytes(H hash_state, const T& value) {
  423|   687M|  const unsigned char* start = reinterpret_cast<const unsigned char*>(&value);
  424|   687M|  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|   687M|  } else {
  432|   687M|    static_assert(sizeof(T) == 8);
  433|   687M|    v = absl::base_internal::UnalignedLoad64(start);
  434|   687M|  }
  435|   687M|  return CombineRaw()(std::move(hash_state), v);
  436|   687M|}
_ZNK4absl12lts_2026081713hash_internal10CombineRawclINS1_15MixingHashStateEEET_S5_m:
  404|   687M|  H operator()(H state, uint64_t value) const {
  405|   687M|    return H::combine_raw(std::move(state), value);
  406|   687M|  }
_ZNK4absl12lts_2026081713hash_internal12HashWithSeed4hashINS0_18container_internal10StringHashENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEEmRKT_RKT0_m:
  412|   265M|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|   265M|    return hasher.hash_with_seed(value, seed);
  415|   265M|  }
_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|   687M|  size_t operator()(const T& value) const {
 1581|   687M|    return MixingHashState::hash(value);
 1582|   687M|  }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal15MixingHashState4hashIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEEEmRKT_:
 1457|   687M|  static size_t hash(const T& value) {
 1458|   687M|    return hash_with_seed(value, Seed());
 1459|   687M|  }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal15MixingHashState14hash_with_seedIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisETnNSt3__19enable_ifIXntsr16IntegralFastPathIT_EE5valueEiE4typeELi0EEEmRKSC_m:
 1473|   687M|  static size_t hash_with_seed(const T& value, size_t seed) {
 1474|   687M|    return static_cast<size_t>(combine(MixingHashState{seed}, value).state_);
 1475|   687M|  }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEJEEES3_S3_RKT_DpRKT0_:
 1598|   687M|H HashStateBase<H>::combine(H state, const T& value, const Ts&... values) {
 1599|   687M|  return H::combine(hash_internal::HashSelect::template Apply<T>::Invoke(
 1600|   687M|                        std::move(state), value),
 1601|   687M|                    values...);
 1602|   687M|}
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal10HashSelect14HashValueProbe6InvokeINS1_15MixingHashStateEPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEEENSt3__19enable_ifIXsr3stdE9is_same_vIT_DTcl13AbslHashValueclsr3stdE4movefp_Efp0_EEEESE_E4typeESE_RKT0_:
 1376|   687M|        H> {
 1377|   687M|      return AbslHashValue(std::move(state), value);
 1378|   687M|    }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal13AbslHashValueINS1_15MixingHashStateEPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEEENSt3__19enable_ifIXsr3stdE12is_pointer_vIT0_EET_E4typeESD_SC_:
  541|   687M|std::enable_if_t<std::is_pointer_v<T>, H> AbslHashValue(H hash_state, T ptr) {
  542|   687M|  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|   687M|  return H::combine(std::move(hash_state), v);
  548|   687M|}

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

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

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

_ZN4absl12lts_2026081712log_internal13IsInitializedEv:
   54|  14.9k|bool IsInitialized() {
   55|  14.9k|  return logging_initialized.load(std::memory_order_acquire);
   56|  14.9k|}
_ZN4absl12lts_2026081712log_internal13WriteToStderrENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEENS0_11LogSeverityE:
   62|  7.49k|void WriteToStderr(absl::string_view message, absl::LogSeverity severity) {
   63|  7.49k|  if (message.empty()) return;
  ------------------
  |  Branch (63:7): [True: 0, False: 7.49k]
  ------------------
   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|  7.49k|  std::fwrite(message.data(), message.size(), 1, stderr);
   80|  7.49k|#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|  7.49k|  (void)severity;
   94|  7.49k|#endif
   95|  7.49k|}
_ZN4absl12lts_2026081712log_internal8TimeZoneEv:
  109|  7.49k|const absl::TimeZone* TimeZone() {
  110|  7.49k|  return timezone_ptr.load(std::memory_order_acquire);
  111|  7.49k|}

_ZN4absl12lts_2026081712log_internal15FormatLogPrefixENS0_11LogSeverityENS0_4TimeEiNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiNS1_12PrefixFormatERNS0_4SpanIcEE:
  194|  7.49k|                       int line, PrefixFormat format, absl::Span<char>& buf) {
  195|  7.49k|  auto prefix_size = FormatBoundedFields(severity, timestamp, tid, buf);
  196|  7.49k|  prefix_size += log_internal::AppendTruncated(basename, buf);
  197|  7.49k|  prefix_size += FormatLineNumber(line, buf);
  198|  7.49k|  if (format == PrefixFormat::kRaw)
  ------------------
  |  Branch (198:7): [True: 0, False: 7.49k]
  ------------------
  199|      0|    prefix_size += log_internal::AppendTruncated("RAW: ", buf);
  200|  7.49k|  return prefix_size;
  201|  7.49k|}
log_format.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_119FormatBoundedFieldsENS0_11LogSeverityENS0_4TimeEiRNS0_4SpanIcEE:
   78|  7.49k|                           log_internal::Tid tid, absl::Span<char>& buf) {
   79|  7.49k|  constexpr size_t kBoundedFieldsMaxLen =
   80|  7.49k|      sizeof("SMMDD HH:MM:SS.NNNNNN  ") +
   81|  7.49k|      (1 + std::numeric_limits<log_internal::Tid>::digits10 + 1) - sizeof("");
   82|  7.49k|  if (ABSL_PREDICT_FALSE(buf.size() < kBoundedFieldsMaxLen)) {
  ------------------
  |  |  190|  7.49k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7.49k]
  |  |  |  Branch (190:49): [Folded, False: 7.49k]
  |  |  |  Branch (190:58): [True: 0, False: 7.49k]
  |  |  ------------------
  ------------------
   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|  7.49k|  const absl::TimeZone* tz = absl::log_internal::TimeZone();
   96|  7.49k|  if (ABSL_PREDICT_FALSE(tz == nullptr)) {
  ------------------
  |  |  190|  7.49k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 7.49k, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 7.49k]
  |  |  |  Branch (190:58): [True: 7.49k, 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|  7.49k|    auto tv = absl::ToTimeval(timestamp);
  102|  7.49k|    int snprintf_result = absl::SNPrintF(
  103|  7.49k|        buf.data(), buf.size(), "%c0000 00:00:%02d.%06d %7d ",
  104|  7.49k|        absl::LogSeverityName(severity)[0], static_cast<int>(tv.tv_sec),
  105|  7.49k|        static_cast<int>(tv.tv_usec), static_cast<int>(tid));
  106|  7.49k|    if (snprintf_result >= 0) {
  ------------------
  |  Branch (106:9): [True: 7.49k, False: 0]
  ------------------
  107|  7.49k|      buf.remove_prefix(static_cast<size_t>(snprintf_result));
  108|  7.49k|      return static_cast<size_t>(snprintf_result);
  109|  7.49k|    }
  110|      0|    return 0;
  111|  7.49k|  }
  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|  7.49k|}
log_format.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_116FormatLineNumberEiRNS0_4SpanIcEE:
  149|  7.49k|size_t FormatLineNumber(int line, absl::Span<char>& buf) {
  150|  7.49k|  constexpr size_t kLineFieldMaxLen =
  151|  7.49k|      sizeof(":] ") + (1 + std::numeric_limits<int>::digits10 + 1) - sizeof("");
  152|  7.49k|  if (ABSL_PREDICT_FALSE(buf.size() < kLineFieldMaxLen)) {
  ------------------
  |  |  190|  7.49k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7.49k]
  |  |  |  Branch (190:49): [Folded, False: 7.49k]
  |  |  |  Branch (190:58): [True: 0, False: 7.49k]
  |  |  ------------------
  ------------------
  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|  7.49k|  char* p = buf.data();
  159|  7.49k|  *p++ = ':';
  160|  7.49k|  p = absl::numbers_internal::FastIntToBuffer(line, p);
  161|  7.49k|  *p++ = ']';
  162|  7.49k|  *p++ = ' ';
  163|  7.49k|  const size_t bytes_formatted = static_cast<size_t>(p - buf.data());
  164|  7.49k|  buf.remove_prefix(bytes_formatted);
  165|  7.49k|  return bytes_formatted;
  166|  7.49k|}

_ZN4absl12lts_2026081712log_internal10LogMessage19CopyToEncodedBufferILNS2_10StringTypeE0EEEvNSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE:
  607|  29.9k|void LogMessage::CopyToEncodedBuffer(absl::string_view str) {
  608|  29.9k|  auto encoded_remaining_copy = data_->encoded_remaining();
  609|  29.9k|  constexpr uint8_t tag_value = str_type == StringType::kLiteral
  ------------------
  |  Branch (609:33): [True: 0, Folded]
  ------------------
  610|  29.9k|                                    ? ValueTag::kStringLiteral
  611|  29.9k|                                    : ValueTag::kString;
  612|  29.9k|  auto start = EncodeMessageStart(
  613|  29.9k|      EventTag::kValue,
  614|  29.9k|      BufferSizeFor(tag_value, WireType::kLengthDelimited) + str.size(),
  615|  29.9k|      &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|  29.9k|  if (EncodeStringTruncate(tag_value, str, &encoded_remaining_copy)) {
  ------------------
  |  Branch (619:7): [True: 29.9k, False: 0]
  ------------------
  620|       |    // The string may have been truncated, but the field header fit.
  621|  29.9k|    EncodeMessageLength(start, &encoded_remaining_copy);
  622|  29.9k|    data_->encoded_remaining() = encoded_remaining_copy;
  623|  29.9k|  } 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|  29.9k|}
_ZN4absl12lts_2026081712log_internal10LogMessage14LogMessageDataC2ENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiNS0_11LogSeverityENS0_4TimeE:
  206|  7.49k|    : extra_sinks_only(false), manipulated(nullptr) {
  207|       |  // Legacy defaults for LOG's ostream:
  208|  7.49k|  manipulated.setf(std::ios_base::showbase | std::ios_base::boolalpha);
  209|  7.49k|  entry.full_filename_ = file;
  210|  7.49k|  entry.base_filename_ = Basename(file);
  211|  7.49k|  entry.line_ = line;
  212|  7.49k|  entry.prefix_ = absl::ShouldPrependLogPrefix();
  213|  7.49k|  entry.severity_ = absl::NormalizeLogSeverity(severity);
  214|  7.49k|  entry.verbose_level_ = absl::LogEntry::kNoVerbosityLevel;
  215|  7.49k|  entry.timestamp_ = timestamp;
  216|  7.49k|  entry.tid_ = absl::base_internal::GetCachedTID();
  217|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessage14LogMessageData27InitializeEncodingAndFormatEv:
  219|  7.49k|void LogMessage::LogMessageData::InitializeEncodingAndFormat() {
  220|  7.49k|  EncodeStringTruncate(EventTag::kFileName, entry.source_filename(),
  221|  7.49k|                       &encoded_remaining());
  222|  7.49k|  EncodeVarint(EventTag::kFileLine, entry.source_line(), &encoded_remaining());
  223|  7.49k|  EncodeVarint(EventTag::kTimeNsecs, absl::ToUnixNanos(entry.timestamp()),
  224|  7.49k|               &encoded_remaining());
  225|  7.49k|  EncodeVarint(EventTag::kSeverity,
  226|  7.49k|               ProtoSeverity(entry.log_severity(), entry.verbosity()),
  227|  7.49k|               &encoded_remaining());
  228|  7.49k|  EncodeVarint(EventTag::kThreadId, static_cast<uint64_t>(entry.tid()),
  229|  7.49k|               &encoded_remaining());
  230|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessage14LogMessageData25FinalizeEncodingAndFormatEv:
  232|  7.49k|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|  7.49k|  absl::Span<const char> encoded_data(
  237|  7.49k|      encoded_buf.data(),
  238|  7.49k|      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|  7.49k|  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|  7.49k|  string_remaining.remove_suffix(2);
  247|  7.49k|  entry.prefix_len_ =
  248|  7.49k|      entry.prefix() ? log_internal::FormatLogPrefix(
  ------------------
  |  Branch (248:7): [True: 7.49k, False: 0]
  ------------------
  249|  7.49k|                           entry.log_severity(), entry.timestamp(), entry.tid(),
  250|  7.49k|                           entry.source_basename(), entry.source_line(),
  251|  7.49k|                           log_internal::ThreadIsLoggingToLogSink()
  ------------------
  |  Branch (251:28): [True: 0, False: 7.49k]
  ------------------
  252|  7.49k|                               ? PrefixFormat::kRaw
  253|  7.49k|                               : PrefixFormat::kNotRaw,
  254|  7.49k|                           string_remaining)
  255|  7.49k|                     : 0;
  256|       |  // Decode data from `encoded_buf` until we run out of data or we run out of
  257|       |  // `string_remaining`.
  258|  7.49k|  ProtoField field;
  259|  97.4k|  while (field.DecodeFrom(&encoded_data)) {
  ------------------
  |  Branch (259:10): [True: 89.9k, False: 7.49k]
  ------------------
  260|  89.9k|    switch (field.tag()) {
  ------------------
  |  Branch (260:13): [True: 52.4k, False: 37.4k]
  ------------------
  261|  52.4k|      case EventTag::kValue:
  ------------------
  |  Branch (261:7): [True: 52.4k, False: 37.4k]
  ------------------
  262|  52.4k|        if (field.type() != WireType::kLengthDelimited) continue;
  ------------------
  |  Branch (262:13): [True: 0, False: 52.4k]
  ------------------
  263|  52.4k|        if (PrintValue(string_remaining, field.bytes_value())) continue;
  ------------------
  |  Branch (263:13): [True: 52.4k, False: 0]
  ------------------
  264|      0|        break;
  265|  89.9k|    }
  266|  89.9k|  }
  267|  7.49k|  auto chars_written =
  268|  7.49k|      static_cast<size_t>(string_remaining.data() - string_buf.data());
  269|  7.49k|    string_buf[chars_written++] = '\n';
  270|  7.49k|  string_buf[chars_written++] = '\0';
  271|  7.49k|  entry.text_message_with_prefix_and_newline_and_nul_ =
  272|  7.49k|      absl::MakeSpan(string_buf).subspan(0, chars_written);
  273|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessageC2EPKciNS0_11LogSeverityE:
  277|  7.49k|  : LogMessage(absl::string_view(file), line, severity) {}
_ZN4absl12lts_2026081712log_internal10LogMessageC2ENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiNS0_11LogSeverityE:
  281|  7.49k|          std::make_unique<LogMessageData>(file, line, severity, absl::Now())) {
  282|  7.49k|  data_->first_fatal = false;
  283|  7.49k|  data_->is_perror = false;
  284|  7.49k|  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|  7.49k|  LogBacktraceIfNeeded();
  290|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessageC2EPKciNS2_10WarningTagE:
  295|  7.49k|    : LogMessage(file, line, absl::LogSeverity::kWarning) {}
_ZN4absl12lts_2026081712log_internal10LogMessageD2Ev:
  300|  7.49k|LogMessage::~LogMessage() = default;
_ZN4absl12lts_2026081712log_internal10LogMessage5FlushEv:
  470|  7.49k|void LogMessage::Flush() {
  471|  7.49k|  if (data_->entry.log_severity() < absl::MinLogLevel()) return;
  ------------------
  |  Branch (471:7): [True: 0, False: 7.49k]
  ------------------
  472|       |
  473|  7.49k|  if (data_->is_perror) {
  ------------------
  |  Branch (473:7): [True: 0, False: 7.49k]
  ------------------
  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|  7.49k|  ABSL_CONST_INIT static std::atomic<bool> seen_fatal(false);
  ------------------
  |  |  847|  7.49k|#define ABSL_CONST_INIT constinit
  ------------------
  480|  7.49k|  if (data_->entry.log_severity() == absl::LogSeverity::kFatal &&
  ------------------
  |  Branch (480:7): [True: 0, False: 7.49k]
  ------------------
  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|  7.49k|  data_->FinalizeEncodingAndFormat();
  492|  7.49k|  data_->entry.encoding_ =
  493|  7.49k|      absl::string_view(data_->encoded_buf.data(),
  494|  7.49k|                        static_cast<size_t>(data_->encoded_remaining().data() -
  495|  7.49k|                                            data_->encoded_buf.data()));
  496|  7.49k|  SendToLog();
  497|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessage11OstreamViewC2ERNS2_14LogMessageDataE:
  502|  22.4k|    : 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.4k|  message_start_ =
  510|  22.4k|      EncodeMessageStart(EventTag::kValue, encoded_remaining_copy_.size(),
  511|  22.4k|                         &encoded_remaining_copy_);
  512|  22.4k|  string_start_ =
  513|  22.4k|      EncodeMessageStart(ValueTag::kString, encoded_remaining_copy_.size(),
  514|  22.4k|                         &encoded_remaining_copy_);
  515|  22.4k|  setp(encoded_remaining_copy_.data(),
  516|  22.4k|       encoded_remaining_copy_.data() + encoded_remaining_copy_.size());
  517|  22.4k|  data_.manipulated.rdbuf(this);
  518|  22.4k|}
_ZN4absl12lts_2026081712log_internal10LogMessage11OstreamViewD2Ev:
  520|  22.4k|LogMessage::OstreamView::~OstreamView() {
  521|  22.4k|  data_.manipulated.rdbuf(nullptr);
  522|  22.4k|  if (!string_start_.data()) {
  ------------------
  |  Branch (522:7): [True: 0, False: 22.4k]
  ------------------
  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.4k|  const absl::Span<const char> contents(pbase(),
  530|  22.4k|                                        static_cast<size_t>(pptr() - pbase()));
  531|  22.4k|  if (contents.empty()) return;
  ------------------
  |  Branch (531:7): [True: 0, False: 22.4k]
  ------------------
  532|  22.4k|  encoded_remaining_copy_.remove_prefix(contents.size());
  533|  22.4k|  EncodeMessageLength(string_start_, &encoded_remaining_copy_);
  534|  22.4k|  EncodeMessageLength(message_start_, &encoded_remaining_copy_);
  535|  22.4k|  data_.encoded_remaining() = encoded_remaining_copy_;
  536|  22.4k|}
_ZN4absl12lts_2026081712log_internal10LogMessage11OstreamView6streamEv:
  538|  22.4k|std::ostream& LogMessage::OstreamView::stream() { return data_.manipulated; }
_ZNK4absl12lts_2026081712log_internal10LogMessage7IsFatalEv:
  540|  14.9k|bool LogMessage::IsFatal() const {
  541|  14.9k|  return data_->entry.log_severity() == absl::LogSeverity::kFatal &&
  ------------------
  |  Branch (541:10): [True: 0, False: 14.9k]
  ------------------
  542|      0|         absl::log_internal::ExitOnDFatal();
  ------------------
  |  Branch (542:10): [True: 0, False: 0]
  ------------------
  543|  14.9k|}
_ZN4absl12lts_2026081712log_internal10LogMessage9SendToLogEv:
  579|  7.49k|void LogMessage::SendToLog() {
  580|  7.49k|  if (IsFatal()) PrepareToDie();
  ------------------
  |  Branch (580:7): [True: 0, False: 7.49k]
  ------------------
  581|       |  // Also log to all registered sinks, even if OnlyLogToStderr() is set.
  582|  7.49k|  log_internal::LogToSinks(data_->entry, absl::MakeSpan(data_->extra_sinks),
  583|  7.49k|                           data_->extra_sinks_only);
  584|  7.49k|  if (IsFatal()) Die();
  ------------------
  |  Branch (584:7): [True: 0, False: 7.49k]
  ------------------
  585|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessage20LogBacktraceIfNeededEv:
  587|  7.49k|void LogMessage::LogBacktraceIfNeeded() {
  588|  7.49k|  if (!absl::log_internal::IsInitialized()) return;
  ------------------
  |  Branch (588:7): [True: 7.49k, 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|   157k|  absl::Span<char>& encoded_remaining() {
  187|   157k|    if (encoded_remaining_actual_do_not_use_directly.data() == nullptr) {
  ------------------
  |  Branch (187:9): [True: 7.49k, False: 149k]
  ------------------
  188|  7.49k|      encoded_remaining_actual_do_not_use_directly =
  189|  7.49k|          absl::MakeSpan(encoded_buf);
  190|  7.49k|      InitializeEncodingAndFormat();
  191|  7.49k|    }
  192|   157k|    return encoded_remaining_actual_do_not_use_directly;
  193|   157k|  }
log_message.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_18BasenameENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
  131|  7.49k|absl::string_view Basename(absl::string_view filepath) {
  132|       |#ifdef _WIN32
  133|       |  size_t path = filepath.find_last_of("/\\");
  134|       |#else
  135|  7.49k|  size_t path = filepath.find_last_of('/');
  136|  7.49k|#endif
  137|  7.49k|  if (path != filepath.npos) filepath.remove_prefix(path + 1);
  ------------------
  |  Branch (137:7): [True: 7.49k, False: 0]
  ------------------
  138|  7.49k|  return filepath;
  139|  7.49k|}
log_message.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_113ProtoSeverityENS0_11LogSeverityEi:
  115|  7.49k|int32_t ProtoSeverity(absl::LogSeverity severity, int verbose_level) {
  116|  7.49k|  switch (severity) {
  117|      0|    case absl::LogSeverity::kInfo:
  ------------------
  |  Branch (117:5): [True: 0, False: 7.49k]
  ------------------
  118|      0|      if (verbose_level == absl::LogEntry::kNoVerbosityLevel) return 800;
  ------------------
  |  Branch (118:11): [True: 0, False: 0]
  ------------------
  119|      0|      return 600 - verbose_level;
  120|  7.49k|    case absl::LogSeverity::kWarning:
  ------------------
  |  Branch (120:5): [True: 7.49k, False: 0]
  ------------------
  121|  7.49k|      return 900;
  122|      0|    case absl::LogSeverity::kError:
  ------------------
  |  Branch (122:5): [True: 0, False: 7.49k]
  ------------------
  123|      0|      return 950;
  124|      0|    case absl::LogSeverity::kFatal:
  ------------------
  |  Branch (124:5): [True: 0, False: 7.49k]
  ------------------
  125|      0|      return 1100;
  126|      0|    default:
  ------------------
  |  Branch (126:5): [True: 0, False: 7.49k]
  ------------------
  127|      0|      return 800;
  128|  7.49k|  }
  129|  7.49k|}
log_message.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_110PrintValueERNS0_4SpanIcEENS3_IKcEE:
   98|  52.4k|bool PrintValue(absl::Span<char>& dst, absl::Span<const char> buf) {
   99|  52.4k|  if (dst.size() <= 1) return false;
  ------------------
  |  Branch (99:7): [True: 0, False: 52.4k]
  ------------------
  100|  52.4k|  ProtoField field;
  101|   104k|  while (field.DecodeFrom(&buf)) {
  ------------------
  |  Branch (101:10): [True: 52.4k, False: 52.4k]
  ------------------
  102|  52.4k|    switch (field.tag()) {
  ------------------
  |  Branch (102:13): [True: 52.4k, False: 0]
  ------------------
  103|  22.4k|      case ValueTag::kString:
  ------------------
  |  Branch (103:7): [True: 22.4k, False: 29.9k]
  ------------------
  104|  52.4k|      case ValueTag::kStringLiteral:
  ------------------
  |  Branch (104:7): [True: 29.9k, False: 22.4k]
  ------------------
  105|  52.4k|        if (field.type() == WireType::kLengthDelimited)
  ------------------
  |  Branch (105:13): [True: 52.4k, False: 0]
  ------------------
  106|  52.4k|          if (log_internal::AppendTruncated(field.string_value(), dst) <
  ------------------
  |  Branch (106:15): [True: 0, False: 52.4k]
  ------------------
  107|  52.4k|              field.string_value().size())
  108|      0|            return false;
  109|  52.4k|    }
  110|  52.4k|  }
  111|  52.4k|  return true;
  112|  52.4k|}

_ZN4absl12lts_2026081712log_internal10LogMessage14InternalStreamEv:
  124|  7.49k|  LogMessage& InternalStream() { return *this; }
_ZN4absl12lts_2026081712log_internal10LogMessagelsEi:
  139|  7.49k|  LogMessage& operator<<(signed int v) { return operator<< <signed int>(v); }
_ZN4absl12lts_2026081712log_internal10LogMessagelsEm:
  152|  14.9k|  LogMessage& operator<<(unsigned long v) {
  153|  14.9k|    return operator<< <unsigned long>(v);
  154|  14.9k|  }
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi2EEERS2_RAT__Kc:
  364|  7.49k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  7.49k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  7.49k|  return *this;
  367|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi21EEERS2_RAT__Kc:
  364|  7.49k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  7.49k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  7.49k|  return *this;
  367|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi20EEERS2_RAT__Kc:
  364|  7.49k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  7.49k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  7.49k|  return *this;
  367|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi11EEERS2_RAT__Kc:
  364|  7.49k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  7.49k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  7.49k|  return *this;
  367|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsIiEERS2_RKT_:
  351|  7.49k|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|  7.49k|  } else {
  357|  7.49k|    OstreamView view(*data_);
  358|  7.49k|    view.stream() << log_internal::NullGuard<T>().Guard(v);
  359|  7.49k|  }
  360|  7.49k|  return *this;
  361|  7.49k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsImEERS2_RKT_:
  351|  14.9k|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|  14.9k|  } else {
  357|  14.9k|    OstreamView view(*data_);
  358|  14.9k|    view.stream() << log_internal::NullGuard<T>().Guard(v);
  359|  14.9k|  }
  360|  14.9k|  return *this;
  361|  14.9k|}

_ZN4absl12lts_2026081712log_internal24ThreadIsLoggingToLogSinkEv:
  277|  14.9k|bool ThreadIsLoggingToLogSink() { return ThreadIsLoggingStatus(); }
_ZN4absl12lts_2026081712log_internal10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEb:
  280|  7.49k|                absl::Span<absl::LogSink*> extra_sinks, bool extra_sinks_only) {
  281|  7.49k|  log_internal::GlobalSinks().LogToSinks(entry, extra_sinks, extra_sinks_only);
  282|  7.49k|}
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_121ThreadIsLoggingStatusEv:
   58|  29.9k|bool& ThreadIsLoggingStatus() {
   59|  29.9k|#ifdef ABSL_HAVE_THREAD_LOCAL
   60|  29.9k|  ABSL_CONST_INIT thread_local bool thread_is_logging = false;
  ------------------
  |  |  847|  29.9k|#define ABSL_CONST_INIT constinit
  ------------------
   61|  29.9k|  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|  29.9k|}
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_111GlobalSinksEv:
  270|  7.49k|GlobalLogSinkSet& GlobalSinks() {
  271|  7.49k|  static absl::NoDestructor<GlobalLogSinkSet> global_sinks;
  272|  7.49k|  return *global_sinks;
  273|  7.49k|}
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|  7.49k|  void Send(const absl::LogEntry& entry) override {
   93|  7.49k|    if (entry.log_severity() < absl::StderrThreshold() &&
  ------------------
  |  Branch (93:9): [True: 7.49k, False: 0]
  ------------------
   94|  7.49k|        absl::log_internal::IsInitialized()) {
  ------------------
  |  Branch (94:9): [True: 0, False: 7.49k]
  ------------------
   95|      0|      return;
   96|      0|    }
   97|       |
   98|  7.49k|    ABSL_CONST_INIT static absl::once_flag warn_if_not_initialized;
  ------------------
  |  |  847|  7.49k|#define ABSL_CONST_INIT constinit
  ------------------
   99|  7.49k|    absl::call_once(warn_if_not_initialized, []() {
  100|  7.49k|      if (absl::log_internal::IsInitialized()) return;
  101|  7.49k|      const char w[] =
  102|  7.49k|          "WARNING: All log messages before absl::InitializeLog() is called"
  103|  7.49k|          " are written to STDERR\n";
  104|  7.49k|      absl::log_internal::WriteToStderr(w, absl::LogSeverity::kWarning);
  105|  7.49k|    });
  106|       |
  107|  7.49k|    if (!entry.stacktrace().empty()) {
  ------------------
  |  Branch (107:9): [True: 0, False: 7.49k]
  ------------------
  108|      0|      absl::log_internal::WriteToStderr(entry.stacktrace(),
  109|      0|                                        entry.log_severity());
  110|  7.49k|    } else {
  111|       |      // TODO(b/226937039): do this outside else condition once we avoid
  112|       |      // ReprintFatalMessage
  113|  7.49k|      absl::log_internal::WriteToStderr(
  114|  7.49k|          entry.text_message_with_prefix_and_newline(), entry.log_severity());
  115|  7.49k|    }
  116|  7.49k|  }
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|  7.49k|      ABSL_LOCKS_EXCLUDED(guard_) {
  188|  7.49k|    SendToSinks(entry, extra_sinks);
  189|       |
  190|  7.49k|    if (!extra_sinks_only) {
  ------------------
  |  Branch (190:9): [True: 7.49k, False: 0]
  ------------------
  191|  7.49k|      if (ThreadIsLoggingToLogSink()) {
  ------------------
  |  Branch (191:11): [True: 0, False: 7.49k]
  ------------------
  192|      0|        absl::log_internal::WriteToStderr(
  193|      0|            entry.text_message_with_prefix_and_newline(), entry.log_severity());
  194|  7.49k|      } else {
  195|  7.49k|        absl::ReaderMutexLock global_sinks_lock(guard_);
  196|  7.49k|        ThreadIsLoggingStatus() = true;
  197|       |        // Ensure the "thread is logging" status is reverted upon leaving the
  198|       |        // scope even in case of exceptions.
  199|  7.49k|        auto status_cleanup =
  200|  7.49k|            absl::MakeCleanup([] { ThreadIsLoggingStatus() = false; });
  201|  7.49k|        SendToSinks(entry, absl::MakeSpan(sinks_));
  202|  7.49k|      }
  203|  7.49k|    }
  204|  7.49k|  }
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_116GlobalLogSinkSet11SendToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEE:
  258|  14.9k|                          absl::Span<absl::LogSink*> sinks) {
  259|  14.9k|    for (absl::LogSink* sink : sinks) {
  ------------------
  |  Branch (259:30): [True: 7.49k, False: 14.9k]
  ------------------
  260|  7.49k|      sink->Send(entry);
  261|  7.49k|    }
  262|  14.9k|  }
log_sink_set.cc:_ZZN4absl12lts_2026081712log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbENKUlvE_clEv:
  200|  7.49k|            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|  14.9k|  static const T& Guard(const T& v) { return v; }
_ZN4absl12lts_2026081712log_internal9NullGuardIiE5GuardERKi:
   45|  7.49k|  static const T& Guard(const T& v) { return v; }

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

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

_ZNKO4absl12lts_2026081712log_internal7VoidifyaaIRNS1_10LogMessageEEEvOT_:
   39|  7.49k|  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|  7.49k|    message.Flush();
   43|  7.49k|  }

_ZNK4absl12lts_202608178LogEntry15source_filenameEv:
   76|  7.49k|  absl::string_view source_filename() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
   77|  7.49k|    return full_filename_;
   78|  7.49k|  }
_ZNK4absl12lts_202608178LogEntry15source_basenameEv:
   79|  7.49k|  absl::string_view source_basename() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
   80|  7.49k|    return base_filename_;
   81|  7.49k|  }
_ZNK4absl12lts_202608178LogEntry11source_lineEv:
   82|  14.9k|  int source_line() const { return line_; }
_ZNK4absl12lts_202608178LogEntry6prefixEv:
   89|  7.49k|  bool prefix() const { return prefix_; }
_ZNK4absl12lts_202608178LogEntry12log_severityEv:
   95|  59.9k|  absl::LogSeverity log_severity() const { return severity_; }
_ZNK4absl12lts_202608178LogEntry9verbosityEv:
  102|  7.49k|  int verbosity() const { return verbose_level_; }
_ZNK4absl12lts_202608178LogEntry9timestampEv:
  113|  14.9k|  absl::Time timestamp() const { return timestamp_; }
_ZNK4absl12lts_202608178LogEntry3tidEv:
  122|  14.9k|  tid_t tid() const { return tid_; }
_ZNK4absl12lts_202608178LogEntry36text_message_with_prefix_and_newlineEv:
  147|  7.49k|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  148|  7.49k|    return absl::string_view(
  149|  7.49k|        text_message_with_prefix_and_newline_and_nul_.data(),
  150|  7.49k|        text_message_with_prefix_and_newline_and_nul_.size() - 1);
  151|  7.49k|  }
_ZNK4absl12lts_202608178LogEntry10stacktraceEv:
  195|  7.49k|  absl::string_view stacktrace() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
  196|  7.49k|    return stacktrace_;
  197|  7.49k|  }
_ZN4absl12lts_202608178LogEntryC2Ev:
  200|  7.49k|  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.37k|               InputIterator last) {
  316|  44.2M|  for (Iterator cur = destination; first != last;
  ------------------
  |  Branch (316:36): [True: 44.2M, False: 1.37k]
  ------------------
  317|  44.2M|       static_cast<void>(++cur), static_cast<void>(++first)) {
  318|  44.2M|    ABSL_INTERNAL_TRY {
  ------------------
  |  |  192|  44.2M|#define ABSL_INTERNAL_TRY try
  ------------------
  319|  44.2M|      std::allocator_traits<Allocator>::construct(alloc, std::addressof(*cur),
  320|  44.2M|                                                  *first);
  321|  44.2M|    }
  322|  44.2M|    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|  44.2M|  }
  330|  1.37k|}

_ZN4absl12lts_202608177uint128mLES1_:
  646|   955M|inline uint128& uint128::operator*=(uint128 other) {
  647|   955M|  *this = *this * other;
  648|   955M|  return *this;
  649|   955M|}
_ZN4absl12lts_2026081712Uint128Low64ENS0_7uint128E:
  661|   955M|constexpr uint64_t Uint128Low64(uint128 v) { return v.lo_; }
_ZN4absl12lts_2026081713Uint128High64ENS0_7uint128E:
  663|   955M|constexpr uint64_t Uint128High64(uint128 v) { return v.hi_; }
_ZNK4absl12lts_202608177uint128cvoEv:
  794|  1.91G|constexpr uint128::operator unsigned __int128() const {
  795|  1.91G|  return (static_cast<unsigned __int128>(hi_) << 64) + lo_;
  796|  1.91G|}
_ZN4absl12lts_20260817eoENS0_7uint128ES1_:
  933|  1.26M|constexpr inline uint128 operator^(uint128 lhs, uint128 rhs) {
  934|  1.26M|#if defined(ABSL_HAVE_INTRINSIC_INT128)
  935|  1.26M|  return static_cast<unsigned __int128>(lhs) ^
  936|  1.26M|         static_cast<unsigned __int128>(rhs);
  937|       |#else
  938|       |  return MakeUint128(Uint128High64(lhs) ^ Uint128High64(rhs),
  939|       |                     Uint128Low64(lhs) ^ Uint128Low64(rhs));
  940|       |#endif
  941|  1.26M|}
_ZN4absl12lts_202608177uint128eOES1_:
  953|  1.26M|inline uint128& uint128::operator^=(uint128 other) {
  954|  1.26M|  *this = *this ^ other;
  955|  1.26M|  return *this;
  956|  1.26M|}
_ZN4absl12lts_20260817mlENS0_7uint128ES1_:
 1059|   955M|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|   955M|  return static_cast<unsigned __int128>(lhs) *
 1063|   955M|         static_cast<unsigned __int128>(rhs);
 1064|   955M|}
_ZN4absl12lts_202608177uint128C2Em:
  683|  1.91G|constexpr uint128::uint128(unsigned long v) : lo_{v}, hi_{0} {}
_ZN4absl12lts_202608177uint128C2Eo:
  692|   956M|    : lo_{static_cast<uint64_t>(v & ~uint64_t{0})},
  693|   956M|      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|  38.0M|  static constexpr result_type(max)() { return (URBG::max)(); }
_ZN4absl12lts_2026081715random_internal17NonsecureURBGBaseINS1_13randen_engineImEENS1_17RandenPoolSeedSeqEE3minEv:
  119|  76.1M|  static constexpr result_type(min)() { return (URBG::min)(); }
_ZN4absl12lts_2026081715random_internal17NonsecureURBGBaseINS1_13randen_engineImEENS1_17RandenPoolSeedSeqEEclEv:
  125|  38.0M|  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.26M|  void Generate(void* state) const {
   48|  1.26M|#if ABSL_RANDOM_INTERNAL_AES_DISPATCH
   49|       |    // HW AES Dispatch.
   50|  1.26M|    if (has_crypto_) {
  ------------------
  |  Branch (50:9): [True: 0, False: 1.26M]
  ------------------
   51|      0|      RandenHwAes::Generate(keys_, state);
   52|  1.26M|    } else {
   53|  1.26M|      RandenSlow::Generate(keys_, state);
   54|  1.26M|    }
   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.26M|  }
_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|  38.0M|  static constexpr result_type(max)() {
   59|  38.0M|    return (std::numeric_limits<result_type>::max)();
   60|  38.0M|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImE3minEv:
   54|  76.1M|  static constexpr result_type(min)() {
   55|  76.1M|    return (std::numeric_limits<result_type>::min)();
   56|  76.1M|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImEclEv:
   85|  38.0M|  result_type operator()() {
   86|       |    // Refill the buffer if needed (unlikely).
   87|  38.0M|    auto* begin = state();
   88|  38.0M|    if (next_ >= kStateSizeT) {
  ------------------
  |  Branch (88:9): [True: 1.26M, False: 36.7M]
  ------------------
   89|  1.26M|      next_ = kCapacityT;
   90|  1.26M|      impl_.Generate(begin);
   91|  1.26M|    }
   92|  38.0M|    return little_endian::ToHost(begin[next_++]);
   93|  38.0M|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImE5stateEv:
  244|  38.0M|  result_type* state() {
  245|  38.0M|    return reinterpret_cast<result_type*>(
  246|  38.0M|        (reinterpret_cast<uintptr_t>(&raw_state_) & 0xf) ? (raw_state_ + 8)
  ------------------
  |  Branch (246:9): [True: 0, False: 38.0M]
  ------------------
  247|  38.0M|                                                         : raw_state_);
  248|  38.0M|  }
_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.26M|void RandenSlow::Generate(const void* keys_void, void* state_void) {
  452|  1.26M|  static_assert(RandenTraits::kCapacityBytes == sizeof(absl::uint128),
  453|  1.26M|                "Capacity mismatch");
  454|       |
  455|  1.26M|  auto* state = reinterpret_cast<absl::uint128*>(state_void);
  456|  1.26M|  const auto* keys = reinterpret_cast<const absl::uint128*>(keys_void);
  457|       |
  458|  1.26M|  const absl::uint128 prev_inner = state[0];
  459|       |
  460|  1.26M|  SwapEndian(state);
  461|       |
  462|  1.26M|  Permute(state, keys);
  463|       |
  464|  1.26M|  SwapEndian(state);
  465|       |
  466|       |  // Ensure backtracking resistance.
  467|  1.26M|  *state ^= prev_inner;
  468|  1.26M|}
randen_slow.cc:_ZN12_GLOBAL__N_110SwapEndianEPN4absl12lts_202608177uint128E:
  401|  2.53M|    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.53M|  (void)state;
  413|  2.53M|#endif
  414|  2.53M|}
randen_slow.cc:_ZN12_GLOBAL__N_17PermuteEPN4absl12lts_202608177uint128EPKS2_:
  392|  1.26M|    const absl::uint128* ABSL_RANDOM_INTERNAL_RESTRICT keys) {
  393|  22.8M|  for (size_t round = 0; round < RandenTraits::kFeistelRounds; ++round) {
  ------------------
  |  Branch (393:26): [True: 21.5M, False: 1.26M]
  ------------------
  394|  21.5M|    keys = FeistelRound(state, keys);
  395|  21.5M|    BlockShuffle(state);
  396|  21.5M|  }
  397|  1.26M|}
randen_slow.cc:_ZN12_GLOBAL__N_112FeistelRoundEPN4absl12lts_202608177uint128EPKS2_:
  366|  21.5M|             const absl::uint128* ABSL_RANDOM_INTERNAL_RESTRICT keys) {
  367|   107M|  for (size_t branch = 0; branch < RandenTraits::kFeistelBlocks; branch += 4) {
  ------------------
  |  Branch (367:27): [True: 86.2M, False: 21.5M]
  ------------------
  368|  86.2M|    const Vector128 s0 = Vector128Load(state + branch);
  369|  86.2M|    const Vector128 s1 = Vector128Load(state + branch + 1);
  370|  86.2M|    const Vector128 f0 = AesRound(s0, Vector128Load(keys));
  371|  86.2M|    keys++;
  372|  86.2M|    const Vector128 o1 = AesRound(f0, s1);
  373|  86.2M|    Vector128Store(o1, state + branch + 1);
  374|       |
  375|       |    // Manually unroll this loop once. about 10% better than not unrolled.
  376|  86.2M|    const Vector128 s2 = Vector128Load(state + branch + 2);
  377|  86.2M|    const Vector128 s3 = Vector128Load(state + branch + 3);
  378|  86.2M|    const Vector128 f2 = AesRound(s2, Vector128Load(keys));
  379|  86.2M|    keys++;
  380|  86.2M|    const Vector128 o3 = AesRound(f2, s3);
  381|  86.2M|    Vector128Store(o3, state + branch + 3);
  382|  86.2M|  }
  383|  21.5M|  return keys;
  384|  21.5M|}
randen_slow.cc:_ZN12_GLOBAL__N_113Vector128LoadEPKv:
  240|   517M|Vector128Load(const void* from) {
  241|   517M|  Vector128 result;
  242|   517M|  std::memcpy(result.s, from, sizeof(Vector128));
  243|   517M|  return result;
  244|   517M|}
randen_slow.cc:_ZN12_GLOBAL__N_18AesRoundERKNS_9Vector128ES2_:
  254|   345M|AesRound(const Vector128& state, const Vector128& round_key) {
  255|   345M|  Vector128 result;
  256|   345M|#ifdef ABSL_IS_LITTLE_ENDIAN
  257|   345M|  result.s[0] = round_key.s[0] ^                  //
  258|   345M|                te0[uint8_t(state.s[0])] ^        //
  259|   345M|                te1[uint8_t(state.s[1] >> 8)] ^   //
  260|   345M|                te2[uint8_t(state.s[2] >> 16)] ^  //
  261|   345M|                te3[uint8_t(state.s[3] >> 24)];
  262|   345M|  result.s[1] = round_key.s[1] ^                  //
  263|   345M|                te0[uint8_t(state.s[1])] ^        //
  264|   345M|                te1[uint8_t(state.s[2] >> 8)] ^   //
  265|   345M|                te2[uint8_t(state.s[3] >> 16)] ^  //
  266|   345M|                te3[uint8_t(state.s[0] >> 24)];
  267|   345M|  result.s[2] = round_key.s[2] ^                  //
  268|   345M|                te0[uint8_t(state.s[2])] ^        //
  269|   345M|                te1[uint8_t(state.s[3] >> 8)] ^   //
  270|   345M|                te2[uint8_t(state.s[0] >> 16)] ^  //
  271|   345M|                te3[uint8_t(state.s[1] >> 24)];
  272|   345M|  result.s[3] = round_key.s[3] ^                  //
  273|   345M|                te0[uint8_t(state.s[3])] ^        //
  274|   345M|                te1[uint8_t(state.s[0] >> 8)] ^   //
  275|   345M|                te2[uint8_t(state.s[1] >> 16)] ^  //
  276|   345M|                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|   345M|  return result;
  300|   345M|}
randen_slow.cc:_ZN12_GLOBAL__N_114Vector128StoreERKNS_9Vector128EPv:
  247|   172M|    const Vector128& v, void* to) {
  248|   172M|  std::memcpy(to, v.s, sizeof(Vector128));
  249|   172M|}
randen_slow.cc:_ZN12_GLOBAL__N_112BlockShuffleEPN4absl12lts_202608177uint128E:
  306|  21.5M|    absl::uint128* state) {
  307|  21.5M|  static_assert(RandenTraits::kFeistelBlocks == 16,
  308|  21.5M|                "Feistel block shuffle only works for 16 blocks.");
  309|       |
  310|  21.5M|  constexpr size_t shuffle[RandenTraits::kFeistelBlocks] = {
  311|  21.5M|      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|  21.5M|  const absl::uint128 v0 = state[shuffle[0]];
  326|  21.5M|  const absl::uint128 v1 = state[shuffle[1]];
  327|  21.5M|  const absl::uint128 v2 = state[shuffle[2]];
  328|  21.5M|  const absl::uint128 v3 = state[shuffle[3]];
  329|  21.5M|  const absl::uint128 v4 = state[shuffle[4]];
  330|  21.5M|  const absl::uint128 v5 = state[shuffle[5]];
  331|  21.5M|  const absl::uint128 v6 = state[shuffle[6]];
  332|  21.5M|  const absl::uint128 v7 = state[shuffle[7]];
  333|  21.5M|  const absl::uint128 w0 = state[shuffle[8]];
  334|  21.5M|  const absl::uint128 w1 = state[shuffle[9]];
  335|  21.5M|  const absl::uint128 w2 = state[shuffle[10]];
  336|  21.5M|  const absl::uint128 w3 = state[shuffle[11]];
  337|  21.5M|  const absl::uint128 w4 = state[shuffle[12]];
  338|  21.5M|  const absl::uint128 w5 = state[shuffle[13]];
  339|  21.5M|  const absl::uint128 w6 = state[shuffle[14]];
  340|  21.5M|  const absl::uint128 w7 = state[shuffle[15]];
  341|  21.5M|  state[0] = v0;
  342|  21.5M|  state[1] = v1;
  343|  21.5M|  state[2] = v2;
  344|  21.5M|  state[3] = v3;
  345|  21.5M|  state[4] = v4;
  346|  21.5M|  state[5] = v5;
  347|  21.5M|  state[6] = v6;
  348|  21.5M|  state[7] = v7;
  349|  21.5M|  state[8] = w0;
  350|  21.5M|  state[9] = w1;
  351|  21.5M|  state[10] = w2;
  352|  21.5M|  state[11] = w3;
  353|  21.5M|  state[12] = w4;
  354|  21.5M|  state[13] = w5;
  355|  21.5M|  state[14] = w6;
  356|  21.5M|  state[15] = w7;
  357|  21.5M|}

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

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

str_cat.cc:_ZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumEE3$_0EEvRT_NSF_9size_typeET0_:
   48|  51.0M|                              Op append_op) {
   49|  51.0M|  if (ABSL_PREDICT_FALSE(append_n > str.max_size() - str.size())) {
  ------------------
  |  |  190|  51.0M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 51.0M]
  |  |  |  Branch (190:49): [Folded, False: 51.0M]
  |  |  |  Branch (190:58): [True: 0, False: 51.0M]
  |  |  ------------------
  ------------------
   50|      0|    ThrowStdLengthError("absl::strings_internal::StringAppendAndOverwrite");
   51|      0|  }
   52|       |
   53|  51.0M|  auto old_size = str.size();
   54|  51.0M|  auto resize = old_size + append_n;
   55|       |
   56|  51.0M|  if (resize > str.capacity()) {
  ------------------
  |  Branch (56:7): [True: 12.5k, False: 50.9M]
  ------------------
   57|       |    // Make sure to always grow by at least a factor of 2x.
   58|  12.5k|    const auto min_growth = str.capacity();
   59|  12.5k|    if (ABSL_PREDICT_FALSE(str.capacity() > str.max_size() - min_growth)) {
  ------------------
  |  |  190|  12.5k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 12.5k]
  |  |  |  Branch (190:49): [Folded, False: 12.5k]
  |  |  |  Branch (190:58): [True: 0, False: 12.5k]
  |  |  ------------------
  ------------------
   60|      0|      str.reserve(str.max_size());
   61|  12.5k|    } else if (resize < str.capacity() + min_growth) {
  ------------------
  |  Branch (61:16): [True: 12.5k, False: 0]
  ------------------
   62|  12.5k|      str.reserve(str.capacity() + min_growth);
   63|  12.5k|    }
   64|  12.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|  51.0M|  StringResizeAndOverwriteImpl(
   70|  51.0M|      str, resize,
   71|  51.0M|      [old_size, append_n, do_append = std::move(append_op)](
   72|  51.0M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  51.0M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  51.0M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  51.0M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  51.0M|                                               typename T::size_type{0});
   77|  51.0M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  51.0M|        return old_size + num_appended;
   79|  51.0M|      });
   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|  51.0M|}
str_cat.cc:_ZZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumEE3$_0EEvRT_NSF_9size_typeET0_ENUlPcmE_clESJ_m:
   72|  51.0M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  51.0M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  51.0M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  51.0M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  51.0M|                                               typename T::size_type{0});
   77|  51.0M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  51.0M|        return old_size + num_appended;
   79|  51.0M|      });
str_cat.cc:_ZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumESD_E3$_0EEvRT_NSF_9size_typeET0_:
   48|  1.03M|                              Op append_op) {
   49|  1.03M|  if (ABSL_PREDICT_FALSE(append_n > str.max_size() - str.size())) {
  ------------------
  |  |  190|  1.03M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1.03M]
  |  |  |  Branch (190:49): [Folded, False: 1.03M]
  |  |  |  Branch (190:58): [True: 0, False: 1.03M]
  |  |  ------------------
  ------------------
   50|      0|    ThrowStdLengthError("absl::strings_internal::StringAppendAndOverwrite");
   51|      0|  }
   52|       |
   53|  1.03M|  auto old_size = str.size();
   54|  1.03M|  auto resize = old_size + append_n;
   55|       |
   56|  1.03M|  if (resize > str.capacity()) {
  ------------------
  |  Branch (56:7): [True: 0, False: 1.03M]
  ------------------
   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.03M|  StringResizeAndOverwriteImpl(
   70|  1.03M|      str, resize,
   71|  1.03M|      [old_size, append_n, do_append = std::move(append_op)](
   72|  1.03M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  1.03M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  1.03M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  1.03M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  1.03M|                                               typename T::size_type{0});
   77|  1.03M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  1.03M|        return old_size + num_appended;
   79|  1.03M|      });
   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.03M|}
str_cat.cc:_ZZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumESD_E3$_0EEvRT_NSF_9size_typeET0_ENUlPcmE_clESJ_m:
   72|  1.03M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  1.03M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  1.03M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  1.03M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  1.03M|                                               typename T::size_type{0});
   77|  1.03M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  1.03M|        return old_size + num_appended;
   79|  1.03M|      });

_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|  7.49k|bool ConvertIntArg(T v, FormatConversionSpecImpl conv, FormatSinkImpl *sink) {
  370|  7.49k|  using U = typename MakeUnsigned<T>::type;
  371|  7.49k|  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|  7.49k|  switch (static_cast<uint8_t>(conv.conversion_char())) {
  378|  7.49k|    case static_cast<uint8_t>(FormatConversionCharInternal::c):
  ------------------
  |  Branch (378:5): [True: 7.49k, False: 0]
  ------------------
  379|  7.49k|      return (std::is_same_v<T, wchar_t> || (conv.length_mod() == LengthMod::l))
  ------------------
  |  Branch (379:15): [Folded, False: 7.49k]
  |  Branch (379:45): [True: 0, False: 7.49k]
  ------------------
  380|  7.49k|                 ? ConvertWCharTImpl(static_cast<wchar_t>(v), conv, sink)
  381|  7.49k|                 : ConvertCharImpl(static_cast<char>(v), conv, sink);
  382|       |
  383|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::o):
  ------------------
  |  Branch (383:5): [True: 0, False: 7.49k]
  ------------------
  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: 7.49k]
  ------------------
  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: 7.49k]
  ------------------
  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: 7.49k]
  ------------------
  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: 7.49k]
  ------------------
  399|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::i):
  ------------------
  |  Branch (399:5): [True: 0, False: 7.49k]
  ------------------
  400|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::v):
  ------------------
  |  Branch (400:5): [True: 0, False: 7.49k]
  ------------------
  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: 7.49k]
  ------------------
  405|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::e):
  ------------------
  |  Branch (405:5): [True: 0, False: 7.49k]
  ------------------
  406|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::f):
  ------------------
  |  Branch (406:5): [True: 0, False: 7.49k]
  ------------------
  407|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::g):
  ------------------
  |  Branch (407:5): [True: 0, False: 7.49k]
  ------------------
  408|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::A):
  ------------------
  |  Branch (408:5): [True: 0, False: 7.49k]
  ------------------
  409|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::E):
  ------------------
  |  Branch (409:5): [True: 0, False: 7.49k]
  ------------------
  410|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::F):
  ------------------
  |  Branch (410:5): [True: 0, False: 7.49k]
  ------------------
  411|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::G):
  ------------------
  |  Branch (411:5): [True: 0, False: 7.49k]
  ------------------
  412|      0|      return ConvertFloatImpl(static_cast<double>(v), conv, sink);
  413|       |
  414|      0|    default:
  ------------------
  |  Branch (414:5): [True: 0, False: 7.49k]
  ------------------
  415|      0|      ABSL_ASSUME(false);
  ------------------
  |  |  272|      0|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  416|  7.49k|  }
  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|  23.0k|bool ConvertIntArg(T v, FormatConversionSpecImpl conv, FormatSinkImpl *sink) {
  370|  23.0k|  using U = typename MakeUnsigned<T>::type;
  371|  23.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|  23.0k|  switch (static_cast<uint8_t>(conv.conversion_char())) {
  378|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::c):
  ------------------
  |  Branch (378:5): [True: 0, False: 23.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: 23.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: 23.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: 22.4k]
  ------------------
  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: 23.0k]
  ------------------
  395|      0|      as_digits.PrintAsDec(static_cast<U>(v));
  396|      0|      break;
  397|       |
  398|  22.4k|    case static_cast<uint8_t>(FormatConversionCharInternal::d):
  ------------------
  |  Branch (398:5): [True: 22.4k, False: 512]
  ------------------
  399|  22.4k|    case static_cast<uint8_t>(FormatConversionCharInternal::i):
  ------------------
  |  Branch (399:5): [True: 0, False: 23.0k]
  ------------------
  400|  22.4k|    case static_cast<uint8_t>(FormatConversionCharInternal::v):
  ------------------
  |  Branch (400:5): [True: 0, False: 23.0k]
  ------------------
  401|  22.4k|      as_digits.PrintAsDec(v);
  402|  22.4k|      break;
  403|       |
  404|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::a):
  ------------------
  |  Branch (404:5): [True: 0, False: 23.0k]
  ------------------
  405|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::e):
  ------------------
  |  Branch (405:5): [True: 0, False: 23.0k]
  ------------------
  406|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::f):
  ------------------
  |  Branch (406:5): [True: 0, False: 23.0k]
  ------------------
  407|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::g):
  ------------------
  |  Branch (407:5): [True: 0, False: 23.0k]
  ------------------
  408|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::A):
  ------------------
  |  Branch (408:5): [True: 0, False: 23.0k]
  ------------------
  409|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::E):
  ------------------
  |  Branch (409:5): [True: 0, False: 23.0k]
  ------------------
  410|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::F):
  ------------------
  |  Branch (410:5): [True: 0, False: 23.0k]
  ------------------
  411|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::G):
  ------------------
  |  Branch (411:5): [True: 0, False: 23.0k]
  ------------------
  412|      0|      return ConvertFloatImpl(static_cast<double>(v), conv, sink);
  413|       |
  414|      0|    default:
  ------------------
  |  Branch (414:5): [True: 0, False: 23.0k]
  ------------------
  415|      0|      ABSL_ASSUME(false);
  ------------------
  |  |  272|      0|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  416|  23.0k|  }
  417|       |
  418|  23.0k|  if (conv.is_basic()) {
  ------------------
  |  Branch (418:7): [True: 0, False: 23.0k]
  ------------------
  419|      0|    sink->Append(as_digits.with_neg_and_zero());
  420|      0|    return true;
  421|      0|  }
  422|  23.0k|  return ConvertIntImplInnerSlow(as_digits, conv, sink);
  423|  23.0k|}
_ZN4absl12lts_2026081719str_format_internal17FormatConvertImplEcNS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  556|  7.49k|                                    FormatSinkImpl *sink) {
  557|  7.49k|  return {ConvertIntArg(v, conv, sink)};
  558|  7.49k|}
_ZN4absl12lts_2026081719str_format_internal17FormatConvertImplEiNS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  588|  23.0k|                                        FormatSinkImpl *sink) {
  589|  23.0k|  return {ConvertIntArg(v, conv, sink)};
  590|  23.0k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_115ConvertCharImplEcNS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  226|  7.49k|                     FormatSinkImpl* sink) {
  227|  7.49k|  size_t fill = 0;
  228|  7.49k|  if (conv.width() >= 0)
  ------------------
  |  Branch (228:7): [True: 0, False: 7.49k]
  ------------------
  229|      0|    fill = static_cast<size_t>(conv.width());
  230|  7.49k|  ReducePadding(1, &fill);
  231|  7.49k|  if (!conv.has_left_flag()) sink->Append(fill, ' ');
  ------------------
  |  Branch (231:7): [True: 7.49k, False: 0]
  ------------------
  232|  7.49k|  sink->Append(1, v);
  233|  7.49k|  if (conv.has_left_flag()) sink->Append(fill, ' ');
  ------------------
  |  Branch (233:7): [True: 0, False: 7.49k]
  ------------------
  234|  7.49k|  return true;
  235|  7.49k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_113ReducePaddingEmPm:
   54|  30.5k|void ReducePadding(size_t n, size_t *capacity) {
   55|  30.5k|  *capacity = Excess(n, *capacity);
   56|  30.5k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_123ConvertIntImplInnerSlowERKNS2_9IntDigitsENS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  239|  23.0k|                             FormatSinkImpl *sink) {
  240|       |  // Print as a sequence of Substrings:
  241|       |  //   [left_spaces][sign][base_indicator][zeroes][formatted][right_spaces]
  242|  23.0k|  size_t fill = 0;
  243|  23.0k|  if (conv.width() >= 0)
  ------------------
  |  Branch (243:7): [True: 23.0k, False: 0]
  ------------------
  244|  23.0k|    fill = static_cast<size_t>(conv.width());
  245|       |
  246|  23.0k|  string_view formatted = as_digits.without_neg_or_zero();
  247|  23.0k|  ReducePadding(formatted, &fill);
  248|       |
  249|  23.0k|  string_view sign = SignColumn(as_digits.is_negative(), conv);
  250|  23.0k|  ReducePadding(sign, &fill);
  251|       |
  252|  23.0k|  string_view base_indicator = BaseIndicator(as_digits, conv);
  253|  23.0k|  ReducePadding(base_indicator, &fill);
  254|       |
  255|  23.0k|  bool precision_specified = conv.precision() >= 0;
  256|  23.0k|  size_t precision =
  257|  23.0k|      precision_specified ? static_cast<size_t>(conv.precision()) : size_t{1};
  ------------------
  |  Branch (257:7): [True: 0, False: 23.0k]
  ------------------
  258|       |
  259|  23.0k|  if (conv.has_alt_flag() &&
  ------------------
  |  Branch (259:7): [True: 0, False: 23.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|  23.0k|  size_t num_zeroes = Excess(formatted.size(), precision);
  271|  23.0k|  ReducePadding(num_zeroes, &fill);
  272|       |
  273|  23.0k|  size_t num_left_spaces = !conv.has_left_flag() ? fill : 0;
  ------------------
  |  Branch (273:28): [True: 23.0k, False: 0]
  ------------------
  274|  23.0k|  size_t num_right_spaces = conv.has_left_flag() ? fill : 0;
  ------------------
  |  Branch (274:29): [True: 0, False: 23.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|  23.0k|  if (!precision_specified && conv.has_zero_flag()) {
  ------------------
  |  Branch (279:7): [True: 23.0k, False: 0]
  |  Branch (279:31): [True: 15.5k, False: 7.49k]
  ------------------
  280|  15.5k|    num_zeroes += num_left_spaces;
  281|  15.5k|    num_left_spaces = 0;
  282|  15.5k|  }
  283|       |
  284|  23.0k|  sink->Append(num_left_spaces, ' ');
  285|  23.0k|  sink->Append(sign);
  286|  23.0k|  sink->Append(base_indicator);
  287|  23.0k|  sink->Append(num_zeroes, '0');
  288|  23.0k|  sink->Append(formatted);
  289|  23.0k|  sink->Append(num_right_spaces, ' ');
  290|  23.0k|  return true;
  291|  23.0k|}
arg.cc:_ZNK4absl12lts_2026081719str_format_internal12_GLOBAL__N_19IntDigits19without_neg_or_zeroEv:
  179|  23.0k|  string_view without_neg_or_zero() const {
  180|  23.0k|    static_assert('-' < '0', "The check below verifies both.");
  181|  23.0k|    size_t advance = start_[0] <= '0' ? 1 : 0;
  ------------------
  |  Branch (181:22): [True: 2, False: 23.0k]
  ------------------
  182|  23.0k|    return {start_ + advance, size_ - advance};
  183|  23.0k|  }
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_113ReducePaddingENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEPm:
   49|  69.0k|void ReducePadding(string_view s, size_t *capacity) {
   50|  69.0k|  *capacity = Excess(s.size(), *capacity);
   51|  69.0k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_110SignColumnEbNS1_24FormatConversionSpecImplE:
  214|  23.0k|string_view SignColumn(bool neg, const FormatConversionSpecImpl conv) {
  215|  23.0k|  if (conv.conversion_char() == FormatConversionCharInternal::d ||
  ------------------
  |  Branch (215:7): [True: 22.4k, False: 512]
  ------------------
  216|  22.4k|      conv.conversion_char() == FormatConversionCharInternal::i) {
  ------------------
  |  Branch (216:7): [True: 0, False: 512]
  ------------------
  217|  22.4k|    if (neg) return "-";
  ------------------
  |  Branch (217:9): [True: 0, False: 22.4k]
  ------------------
  218|  22.4k|    if (conv.has_show_pos_flag()) return "+";
  ------------------
  |  Branch (218:9): [True: 0, False: 22.4k]
  ------------------
  219|  22.4k|    if (conv.has_sign_col_flag()) return " ";
  ------------------
  |  Branch (219:9): [True: 0, False: 22.4k]
  ------------------
  220|  22.4k|  }
  221|  23.0k|  return {};
  222|  23.0k|}
arg.cc:_ZNK4absl12lts_2026081719str_format_internal12_GLOBAL__N_19IntDigits11is_negativeEv:
  185|  23.0k|  bool is_negative() const { return start_[0] == '-'; }
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_113BaseIndicatorERKNS2_9IntDigitsENS1_24FormatConversionSpecImplE:
  197|  23.0k|                          const FormatConversionSpecImpl conv) {
  198|       |  // always show 0x for %p.
  199|  23.0k|  bool alt = conv.has_alt_flag() ||
  ------------------
  |  Branch (199:14): [True: 0, False: 23.0k]
  ------------------
  200|  23.0k|             conv.conversion_char() == FormatConversionCharInternal::p;
  ------------------
  |  Branch (200:14): [True: 0, False: 23.0k]
  ------------------
  201|  23.0k|  bool hex = (conv.conversion_char() == FormatConversionCharInternal::x ||
  ------------------
  |  Branch (201:15): [True: 0, False: 23.0k]
  ------------------
  202|  23.0k|              conv.conversion_char() == FormatConversionCharInternal::X ||
  ------------------
  |  Branch (202:15): [True: 512, False: 22.4k]
  ------------------
  203|  22.4k|              conv.conversion_char() == FormatConversionCharInternal::p);
  ------------------
  |  Branch (203:15): [True: 0, False: 22.4k]
  ------------------
  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|  23.0k|  if (alt && hex && !as_digits.without_neg_or_zero().empty()) {
  ------------------
  |  Branch (207:7): [True: 0, False: 23.0k]
  |  Branch (207:7): [True: 0, False: 23.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|  23.0k|  return {};
  212|  23.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|  22.4k|  void PrintAsDec(T v) {
   99|  22.4k|    static_assert(std::is_integral_v<T>, "");
  100|  22.4k|    start_ = storage_;
  101|  22.4k|    size_ = static_cast<size_t>(numbers_internal::FastIntToBuffer(v, storage_) -
  102|  22.4k|                                storage_);
  103|  22.4k|  }

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

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

_ZNK4absl12lts_2026081719str_format_internal15BoundConversion3argEv:
   43|  30.5k|  const FormatArgImpl* arg() const { return arg_; }
_ZN4absl12lts_2026081719str_format_internal15BoundConversion7set_argEPKNS1_13FormatArgImplE:
   44|  30.5k|  void set_arg(const FormatArgImpl* a) { arg_ = a; }
_ZN4absl12lts_2026081719str_format_internal21UntypedFormatSpecImplC2ENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   56|  8.01k|      : data_(s.data()), size_(s.size()) {}
_ZNK4absl12lts_2026081719str_format_internal21UntypedFormatSpecImpl21has_parsed_conversionEv:
   61|  8.01k|  bool has_parsed_conversion() const { return size_ == ~size_t{}; }
_ZNK4absl12lts_2026081719str_format_internal21UntypedFormatSpecImpl3strEv:
   63|  8.01k|  string_view str() const {
   64|       |    assert(!has_parsed_conversion());
   65|  8.01k|    return string_view(static_cast<const char*>(data_), size_);
   66|  8.01k|  }
_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|  7.49k|  static const UntypedFormatSpecImpl& Extract(const T& s) {
   74|  7.49k|    return s.spec_;
   75|  7.49k|  }
_ZN4absl12lts_2026081719str_format_internal18FormatSpecTemplateIJLNS0_23FormatConversionCharSetE131067ELS3_655355ELS3_655355ELS3_655355EEEC2EUa9enable_ifIXclL_ZNS1_15ValidFormatImplIJLS3_131067ELS3_655355ELS3_655355ELS3_655355EEEEbNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEfL0p_EEEPKc:
  159|  7.49k|      : Base(s) {}

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

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

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

_ZN4absl12lts_2026081719str_format_internal13BufferRawSinkC2EPcm:
   41|  7.49k|  BufferRawSink(char* buffer, size_t size) : buffer_(buffer), size_(size) {}
_ZNK4absl12lts_2026081719str_format_internal13BufferRawSink13total_writtenEv:
   43|  7.49k|  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|  7.49k|inline void AbslFormatFlush(BufferRawSink* sink, string_view v) {
   83|  7.49k|  sink->Write(v);
   84|  7.49k|}
_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|  7.49k|auto InvokeFlush(T* out, string_view s) -> decltype(AbslFormatFlush(out, s)) {
   90|  7.49k|  AbslFormatFlush(out, s);
   91|  7.49k|}

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

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

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

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

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|  51.0M|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|  51.0M|  } else if constexpr (strings_internal::has__resize_default_init<T>::value) {
  160|  51.0M|    str.__resize_default_init(n);
  161|  51.0M|    str.__resize_default_init(
  162|  51.0M|        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|  51.0M|#endif
  169|  51.0M|}
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.03M|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.03M|  } else if constexpr (strings_internal::has__resize_default_init<T>::value) {
  160|  1.03M|    str.__resize_default_init(n);
  161|  1.03M|    str.__resize_default_init(
  162|  1.03M|        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.03M|#endif
  169|  1.03M|}

_ZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumE:
  207|  51.0M|void StrAppend(std::string* absl_nonnull dest, const AlphaNum& a) {
  208|       |  ASSERT_NO_OVERLAP(*dest, a);
  ------------------
  |  |  180|  51.0M|  assert(((src).size() == 0) ||      \
  |  |  181|  51.0M|         (uintptr_t((src).data() - (dest).data()) > uintptr_t((dest).size())))
  ------------------
  209|  51.0M|  strings_internal::StringAppendAndOverwrite(
  210|  51.0M|      *dest, a.size(), [&a](char* const buf, size_t buf_size) {
  211|  51.0M|        char* out = buf;
  212|  51.0M|        out = Append(out, a);
  213|  51.0M|        assert(out == buf + buf_size);
  214|  51.0M|        return buf_size;
  215|  51.0M|      });
  216|  51.0M|}
_ZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumESB_:
  219|  1.03M|               const AlphaNum& b) {
  220|  1.03M|  ASSERT_NO_OVERLAP(*dest, a);
  ------------------
  |  |  180|  1.03M|  assert(((src).size() == 0) ||      \
  |  |  181|  1.03M|         (uintptr_t((src).data() - (dest).data()) > uintptr_t((dest).size())))
  ------------------
  221|       |  ASSERT_NO_OVERLAP(*dest, b);
  ------------------
  |  |  180|  1.03M|  assert(((src).size() == 0) ||      \
  |  |  181|  1.03M|         (uintptr_t((src).data() - (dest).data()) > uintptr_t((dest).size())))
  ------------------
  222|  1.03M|  strings_internal::StringAppendAndOverwrite(
  223|  1.03M|      *dest, SafeAdd(a.size(), b.size()),
  224|  1.03M|      [&a, &b](char* const buf, size_t buf_size) {
  225|  1.03M|        char* out = buf;
  226|  1.03M|        out = Append(out, a);
  227|  1.03M|        out = Append(out, b);
  228|  1.03M|        assert(out == buf + buf_size);
  229|  1.03M|        return buf_size;
  230|  1.03M|      });
  231|  1.03M|}
str_cat.cc:_ZN4absl12lts_2026081712_GLOBAL__N_17SafeAddEmm:
   59|  1.03M|inline size_t SafeAdd(size_t a, size_t b) {
   60|  1.03M|  const uint64_t sum = static_cast<uint64_t>(a) + b;
   61|  1.03M|  if (ABSL_PREDICT_FALSE(sum > (std::numeric_limits<size_t>::max)())) {
  ------------------
  |  |  190|  1.03M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1.03M]
  |  |  |  Branch (190:49): [Folded, False: 1.03M]
  |  |  |  Branch (190:58): [True: 0, False: 1.03M]
  |  |  ------------------
  ------------------
   62|      0|    ThrowStdLengthError("absl string append length overflow");
   63|      0|  }
   64|  1.03M|  return static_cast<size_t>(sum);
   65|  1.03M|}
str_cat.cc:_ZN4absl12lts_2026081712_GLOBAL__N_16AppendEPcRKNS0_8AlphaNumE:
   48|  53.0M|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|  53.0M|  char* after = out + x.size();
   52|  53.0M|  if (x.size() != 0) {
  ------------------
  |  Branch (52:7): [True: 52.0M, False: 1.04M]
  ------------------
   53|  52.0M|    memcpy(out, x.data(), x.size());
   54|  52.0M|  }
   55|  53.0M|  return after;
   56|  53.0M|}
str_cat.cc:_ZZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumEENK3$_0clEPcm:
  210|  51.0M|      *dest, a.size(), [&a](char* const buf, size_t buf_size) {
  211|  51.0M|        char* out = buf;
  212|  51.0M|        out = Append(out, a);
  213|       |        assert(out == buf + buf_size);
  214|  51.0M|        return buf_size;
  215|  51.0M|      });
str_cat.cc:_ZZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumESB_ENK3$_0clEPcm:
  224|  1.03M|      [&a, &b](char* const buf, size_t buf_size) {
  225|  1.03M|        char* out = buf;
  226|  1.03M|        out = Append(out, a);
  227|  1.03M|        out = Append(out, b);
  228|       |        assert(out == buf + buf_size);
  229|  1.03M|        return buf_size;
  230|  1.03M|      });

_ZN4absl12lts_202608178AlphaNumC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  399|  39.8M|      : piece_(pc) {}
_ZN4absl12lts_202608178AlphaNumC2INSt3__19allocatorIcEEEERKNS3_12basic_stringIcNS3_11char_traitsIcEET_EE:
  417|  13.1M|      : piece_(str) {}
_ZNK4absl12lts_202608178AlphaNum4sizeEv:
  425|   211M|  absl::string_view::size_type size() const { return piece_.size(); }
_ZNK4absl12lts_202608178AlphaNum4dataEv:
  426|  52.0M|  const char* absl_nullable data() const { return piece_.data(); }

_ZN4absl12lts_2026081717UntypedFormatSpecC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  112|  8.01k|  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|  7.49k|             const FormatSpec<Args...>& format, const Args&... args) {
  474|  7.49k|  return str_format_internal::SnprintF(
  475|  7.49k|      output, size, str_format_internal::UntypedFormatSpecImpl::Extract(format),
  476|  7.49k|      {str_format_internal::FormatArgImpl(args)...});
  477|  7.49k|}

_ZN4absl12lts_2026081716strings_internal18ApplySubstitutionsENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEPNS2_6vectorINS1_18ViableSubstitutionENS2_9allocatorIS8_EEEEPNS2_12basic_stringIcS5_NS9_IcEEEE:
   41|  13.1M|    std::string* absl_nonnull result_ptr) {
   42|  13.1M|  auto& subs = *subs_ptr;
   43|  13.1M|  int substitutions = 0;
   44|  13.1M|  size_t pos = 0;
   45|  14.2M|  while (!subs.empty()) {
  ------------------
  |  Branch (45:10): [True: 1.03M, False: 13.1M]
  ------------------
   46|  1.03M|    auto& sub = subs.back();
   47|  1.03M|    if (sub.offset >= pos) {
  ------------------
  |  Branch (47:9): [True: 1.03M, False: 0]
  ------------------
   48|  1.03M|      if (pos <= s.size()) {
  ------------------
  |  Branch (48:11): [True: 1.03M, False: 0]
  ------------------
   49|  1.03M|        StrAppend(result_ptr, s.substr(pos, sub.offset - pos), sub.replacement);
   50|  1.03M|      }
   51|  1.03M|      pos = sub.offset + sub.old.size();
   52|  1.03M|      substitutions += 1;
   53|  1.03M|    }
   54|  1.03M|    sub.offset = s.find(sub.old, pos);
   55|  1.03M|    if (sub.offset == s.npos) {
  ------------------
  |  Branch (55:9): [True: 1.03M, False: 0]
  ------------------
   56|  1.03M|      subs.pop_back();
   57|  1.03M|    } 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.03M|  }
   66|  13.1M|  result_ptr->append(s.data() + pos, s.size() - pos);
   67|  13.1M|  return substitutions;
   68|  13.1M|}
_ZN4absl12lts_2026081713StrReplaceAllENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEESt16initializer_listINS1_4pairIS5_S5_EEE:
   81|  13.1M|                          strings_internal::FixedMapping replacements) {
   82|  13.1M|  return StrReplaceAll<strings_internal::FixedMapping>(s, replacements);
   83|  13.1M|}

_ZN4absl12lts_2026081716strings_internal18ViableSubstitutionC2ENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEES7_m:
  145|  1.03M|      : 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|  13.1M|                          const StrToStrMapping& replacements) {
  198|  13.1M|  auto subs = strings_internal::FindSubstitutions(s, replacements);
  199|  13.1M|  std::string result;
  200|  13.1M|  result.reserve(s.size());
  201|  13.1M|  strings_internal::ApplySubstitutions(s, &subs, &result);
  202|  13.1M|  return result;
  203|  13.1M|}
_ZN4absl12lts_2026081716strings_internal17FindSubstitutionsISt16initializer_listINSt3__14pairINS4_17basic_string_viewIcNS4_11char_traitsIcEEEES9_EEEEENS4_6vectorINS1_18ViableSubstitutionENS4_9allocatorISD_EEEES9_RKT_:
  161|  13.1M|    absl::string_view s, const StrToStrMapping& replacements) {
  162|  13.1M|  std::vector<ViableSubstitution> subs;
  163|  13.1M|  subs.reserve(std::size(replacements));
  164|       |
  165|  13.1M|  for (const auto& rep : replacements) {
  ------------------
  |  Branch (165:24): [True: 13.1M, False: 13.1M]
  ------------------
  166|  13.1M|    using std::get;
  167|  13.1M|    absl::string_view old(get<0>(rep));
  168|       |
  169|  13.1M|    size_t pos = s.find(old);
  170|  13.1M|    if (pos == s.npos) continue;
  ------------------
  |  Branch (170:9): [True: 12.1M, False: 1.03M]
  ------------------
  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.03M|    if (old.empty()) continue;
  ------------------
  |  Branch (175:9): [True: 0, False: 1.03M]
  ------------------
  176|       |
  177|  1.03M|    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.03M|    size_t index = subs.size();
  182|  1.03M|    while (--index && subs[index - 1].OccursBefore(subs[index])) {
  ------------------
  |  Branch (182:12): [True: 0, False: 1.03M]
  |  Branch (182:23): [True: 0, False: 0]
  ------------------
  183|      0|      std::swap(subs[index], subs[index - 1]);
  184|      0|    }
  185|  1.03M|  }
  186|  13.1M|  return subs;
  187|  13.1M|}

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

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

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

_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|  7.49k|void Mutex::lock_shared() {
 1557|  7.49k|  ABSL_TSAN_MUTEX_PRE_LOCK(this, __tsan_mutex_read_lock);
 1558|  7.49k|  GraphId id = DebugOnlyDeadlockCheck(this);
 1559|  7.49k|  intptr_t v = mu_.load(std::memory_order_relaxed);
 1560|  7.49k|  for (;;) {
 1561|       |    // If there are non-readers holding the lock, use the slow loop.
 1562|  7.49k|    if (ABSL_PREDICT_FALSE(v & (kMuWriter | kMuWait | kMuEvent)) != 0) {
  ------------------
  |  |  190|  7.49k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:49): [Folded, False: 7.49k]
  |  |  |  Branch (190:58): [True: 0, False: 7.49k]
  |  |  ------------------
  ------------------
  |  Branch (1562:9): [True: 0, False: 7.49k]
  ------------------
 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|  7.49k|    if (ABSL_PREDICT_TRUE(mu_.compare_exchange_weak(
  ------------------
  |  |  191|  7.49k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 7.49k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 7.49k]
  |  |  |  Branch (191:57): [True: 7.49k, False: 0]
  |  |  ------------------
  ------------------
 1569|  7.49k|            v, (kMuReader | v) + kMuOne, std::memory_order_acquire,
 1570|  7.49k|            std::memory_order_relaxed))) {
 1571|  7.49k|      break;
 1572|  7.49k|    }
 1573|  7.49k|  }
 1574|  7.49k|  DebugOnlyLockEnter(this, id);
 1575|  7.49k|  ABSL_TSAN_MUTEX_POST_LOCK(this, __tsan_mutex_read_lock, 0);
 1576|  7.49k|}
_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|  7.49k|void Mutex::unlock_shared() {
 1787|  7.49k|  ABSL_TSAN_MUTEX_PRE_UNLOCK(this, __tsan_mutex_read_lock);
 1788|  7.49k|  DebugOnlyLockLeave(this);
 1789|  7.49k|  intptr_t v = mu_.load(std::memory_order_relaxed);
 1790|  7.49k|  assert((v & (kMuWriter | kMuReader)) == kMuReader);
 1791|  7.49k|  for (;;) {
 1792|  7.49k|    if (ABSL_PREDICT_FALSE((v & (kMuReader | kMuWait | kMuEvent)) !=
  ------------------
  |  |  190|  7.49k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7.49k]
  |  |  |  Branch (190:49): [Folded, False: 7.49k]
  |  |  |  Branch (190:58): [True: 0, False: 7.49k]
  |  |  ------------------
  ------------------
 1793|  7.49k|                           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|  7.49k|    intptr_t clear = ExactlyOneReader(v) ? kMuReader | kMuOne : kMuOne;
  ------------------
  |  Branch (1798:22): [True: 7.49k, False: 0]
  ------------------
 1799|  7.49k|    if (ABSL_PREDICT_TRUE(
  ------------------
  |  |  191|  7.49k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 7.49k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 7.49k]
  |  |  |  Branch (191:57): [True: 7.49k, False: 0]
  |  |  ------------------
  ------------------
 1800|  7.49k|            mu_.compare_exchange_strong(v, v - clear, std::memory_order_release,
 1801|  7.49k|                                        std::memory_order_relaxed))) {
 1802|  7.49k|      break;
 1803|  7.49k|    }
 1804|  7.49k|  }
 1805|  7.49k|  ABSL_TSAN_MUTEX_POST_UNLOCK(this, __tsan_mutex_read_lock);
 1806|  7.49k|}
mutex.cc:_ZN4absl12lts_20260817L22DebugOnlyDeadlockCheckEPNS0_5MutexE:
 1480|  7.50k|static inline GraphId DebugOnlyDeadlockCheck(Mutex* mu) {
 1481|  7.50k|  if (kDebugMode && synch_deadlock_detection.load(std::memory_order_acquire) !=
  ------------------
  |  Branch (1481:7): [Folded, False: 7.50k]
  |  Branch (1481:21): [True: 0, False: 0]
  ------------------
 1482|      0|                        OnDeadlockCycle::kIgnore) {
 1483|      0|    return DeadlockCheck(mu);
 1484|  7.50k|  } else {
 1485|  7.50k|    return InvalidGraphId();
 1486|  7.50k|  }
 1487|  7.50k|}
mutex.cc:_ZN4absl12lts_20260817L18DebugOnlyLockEnterEPNS0_5MutexENS0_24synchronization_internal7GraphIdE:
 1313|  7.50k|static inline void DebugOnlyLockEnter(Mutex* mu, GraphId id) {
 1314|  7.50k|  if (kDebugMode) {
  ------------------
  |  Branch (1314:7): [Folded, False: 7.50k]
  ------------------
 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|  7.50k|}
mutex.cc:_ZN4absl12lts_20260817L18DebugOnlyLockLeaveEPNS0_5MutexE:
 1323|  7.50k|static inline void DebugOnlyLockLeave(Mutex* mu) {
 1324|  7.50k|  if (kDebugMode) {
  ------------------
  |  Branch (1324:7): [Folded, False: 7.50k]
  ------------------
 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|  7.50k|}
mutex.cc:_ZN4absl12lts_20260817L16ExactlyOneReaderEl:
 1776|  7.49k|static bool ExactlyOneReader(intptr_t v) {
 1777|  7.49k|  assert((v & (kMuWriter | kMuReader)) == kMuReader);
 1778|  7.49k|  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|  7.49k|  constexpr intptr_t kMuMultipleWaitersMask = kMuHigh ^ kMuOne;
 1783|  7.49k|  return (v & kMuMultipleWaitersMask) == 0;
 1784|  7.49k|}

_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|  7.49k|      : mu_(mu) {
  673|  7.49k|    mu.lock_shared();
  674|  7.49k|  }
_ZN4absl12lts_2026081715ReaderMutexLockD2Ev:
  698|  7.49k|  ~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|  8.54k|inline Mutex::Mutex() : mu_(0) {
 1188|  8.54k|  ABSL_TSAN_MUTEX_CREATE(this, __tsan_mutex_not_static);
 1189|  8.54k|}
_ZN4absl12lts_202608175MutexD2Ev:
 1195|  8.54k|inline Mutex::~Mutex() { Dtor(); }
_ZN4absl12lts_202608175Mutex4DtorEv:
 1206|  8.54k|inline void Mutex::Dtor() {}

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

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

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

_ZN4absl12lts_2026081711ToUnixNanosENS0_4TimeE:
  249|  7.49k|int64_t ToUnixNanos(Time t) {
  250|  7.49k|  if (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >= 0 &&
  ------------------
  |  Branch (250:7): [True: 7.49k, False: 0]
  ------------------
  251|  7.49k|      time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >> 33 == 0) {
  ------------------
  |  Branch (251:7): [True: 7.49k, False: 0]
  ------------------
  252|  7.49k|    return (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) * 1000 *
  253|  7.49k|            1000 * 1000) +
  254|  7.49k|           (time_internal::GetRepLo(time_internal::ToUnixDuration(t)) / 4);
  255|  7.49k|  }
  256|      0|  return FloorToUnit(time_internal::ToUnixDuration(t), absl::Nanoseconds(1));
  257|  7.49k|}
_ZN4absl12lts_2026081710ToTimespecENS0_4TimeE:
  302|  7.49k|timespec ToTimespec(Time t) {
  303|  7.49k|  timespec ts;
  304|  7.49k|  absl::Duration d = time_internal::ToUnixDuration(t);
  305|  7.49k|  if (!time_internal::IsInfiniteDuration(d)) {
  ------------------
  |  Branch (305:7): [True: 7.49k, False: 0]
  ------------------
  306|  7.49k|    ts.tv_sec = static_cast<decltype(ts.tv_sec)>(time_internal::GetRepHi(d));
  307|  7.49k|    if (ts.tv_sec == time_internal::GetRepHi(d)) {  // no time_t narrowing
  ------------------
  |  Branch (307:9): [True: 7.49k, False: 0]
  ------------------
  308|  7.49k|      ts.tv_nsec = time_internal::GetRepLo(d) / 4;  // floor
  309|  7.49k|      return ts;
  310|  7.49k|    }
  311|  7.49k|  }
  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|  7.49k|}
_ZN4absl12lts_202608179ToTimevalENS0_4TimeE:
  322|  7.49k|timeval ToTimeval(Time t) {
  323|  7.49k|  timeval tv;
  324|  7.49k|  timespec ts = absl::ToTimespec(t);
  325|  7.49k|  tv.tv_sec = static_cast<decltype(tv.tv_sec)>(ts.tv_sec);
  326|  7.49k|  if (tv.tv_sec != ts.tv_sec) {  // narrowing
  ------------------
  |  Branch (326:7): [True: 0, False: 7.49k]
  ------------------
  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|  7.49k|  tv.tv_usec = static_cast<int>(ts.tv_nsec / 1000);  // suseconds_t
  337|  7.49k|  return tv;
  338|  7.49k|}

_ZN4absl12lts_202608178DurationC2Ev:
  185|  7.49k|  constexpr Duration() : rep_hi_(0), rep_lo_(0) {}  // zero-length duration
_ZN4absl12lts_202608178DurationC2Elj:
  247|  19.6k|  constexpr Duration(int64_t hi, uint32_t lo) : rep_hi_(hi), rep_lo_(lo) {}
_ZN4absl12lts_202608178Duration5HiRepC2El:
  267|  27.1k|          lo_(0),
  268|  27.1k|          hi_(0)
  269|       |#endif
  270|  27.1k|    {
  271|  27.1k|      *this = value;
  272|  27.1k|    }
_ZNK4absl12lts_202608178Duration5HiRep3GetEv:
  274|  60.8k|    constexpr int64_t Get() const {
  275|  60.8k|      const uint64_t unsigned_value =
  276|  60.8k|          (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|  60.8k|      static_assert(
  284|  60.8k|          (static_cast<int64_t>((std::numeric_limits<uint64_t>::max)()) ==
  285|  60.8k|           int64_t{-1}) &&
  286|  60.8k|              (static_cast<int64_t>(static_cast<uint64_t>(
  287|  60.8k|                                        (std::numeric_limits<int64_t>::max)()) +
  288|  60.8k|                                    1) ==
  289|  60.8k|               (std::numeric_limits<int64_t>::min)()),
  290|  60.8k|          "static_cast<int64_t>(uint64_t) does not have c++20 semantics");
  291|  60.8k|      return static_cast<int64_t>(unsigned_value);
  292|  60.8k|    }
_ZN4absl12lts_202608178Duration5HiRepaSEl:
  294|  35.4k|    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|  35.4k|      const auto unsigned_value = static_cast<uint64_t>(value);
  300|  35.4k|      hi_ = static_cast<uint32_t>(unsigned_value >> 32);
  301|  35.4k|      lo_ = static_cast<uint32_t>(unsigned_value);
  302|  35.4k|      return *this;
  303|  35.4k|    }
_ZN4absl12lts_202608174TimeC2ENS0_8DurationE:
  877|  19.6k|  constexpr explicit Time(Duration rep) : rep_(rep) {}
_ZN4absl12lts_20260817miENS0_8DurationES1_:
  361|  7.49k|                                                        Duration rhs) {
  362|  7.49k|  return lhs -= rhs;
  363|  7.49k|}
_ZN4absl12lts_20260817miENS0_4TimeES1_:
  920|  7.49k|ABSL_ATTRIBUTE_CONST_FUNCTION inline Duration operator-(Time lhs, Time rhs) {
  921|  7.49k|  return lhs.rep_ - rhs.rep_;
  922|  7.49k|}
_ZN4absl12lts_2026081713time_internal12MakeDurationElj:
 1592|  19.6k|                                                              uint32_t lo = 0) {
 1593|  19.6k|  return Duration(hi, lo);
 1594|  19.6k|}
_ZN4absl12lts_2026081713time_internal12MakeDurationEll:
 1597|  19.6k|                                                              int64_t lo) {
 1598|  19.6k|  return MakeDuration(hi, static_cast<uint32_t>(lo));
 1599|  19.6k|}
_ZN4absl12lts_2026081713time_internal8GetRepHiENS0_8DurationE:
 1624|  22.4k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr int64_t GetRepHi(Duration d) {
 1625|  22.4k|  return d.rep_hi_.Get();
 1626|  22.4k|}
_ZN4absl12lts_2026081713time_internal8GetRepLoENS0_8DurationE:
 1627|  44.9k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr uint32_t GetRepLo(Duration d) {
 1628|  44.9k|  return d.rep_lo_;
 1629|  44.9k|}
_ZN4absl12lts_2026081713time_internal18IsInfiniteDurationENS0_8DurationE:
 1632|  22.4k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr bool IsInfiniteDuration(Duration d) {
 1633|  22.4k|  return GetRepLo(d) == ~uint32_t{0};
 1634|  22.4k|}
_ZN4absl12lts_2026081713time_internal16FromUnixDurationENS0_8DurationE:
 1657|  19.6k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr Time FromUnixDuration(Duration d) {
 1658|  19.6k|  return Time(d);
 1659|  19.6k|}
_ZN4absl12lts_2026081713time_internal14ToUnixDurationENS0_4TimeE:
 1660|  14.9k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr Duration ToUnixDuration(Time t) {
 1661|  14.9k|  return t.rep_;
 1662|  14.9k|}
_ZN4absl12lts_2026081719ToInt64MillisecondsENS0_8DurationE:
 1885|  7.49k|    Duration d) {
 1886|  7.49k|  if (time_internal::GetRepHi(d) >= 0 &&
  ------------------
  |  Branch (1886:7): [True: 7.49k, False: 0]
  ------------------
 1887|  7.49k|      time_internal::GetRepHi(d) >> 53 == 0) {
  ------------------
  |  Branch (1887:7): [True: 7.49k, False: 0]
  ------------------
 1888|  7.49k|    return (time_internal::GetRepHi(d) * 1000) +
 1889|  7.49k|           (time_internal::GetRepLo(d) /
 1890|  7.49k|            (time_internal::kTicksPerNanosecond * 1000 * 1000));
 1891|  7.49k|  } else {
 1892|      0|    return d / Milliseconds(1);
 1893|      0|  }
 1894|  7.49k|}
_ZN4absl12lts_202608174TimeC2Ev:
  802|  7.49k|  constexpr Time() = default;

_ZN4absl12lts_2026081713span_internal7GetDataIKNS0_10FixedArrayINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEELm128ENS4_9allocatorIS8_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  1.37k|    -> decltype(GetDataImpl(c, 0)) {
   51|  1.37k|  return GetDataImpl(c, 0);
   52|  1.37k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNS0_10FixedArrayINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEELm128ENS4_9allocatorIS8_EEEEEEDTcldtfp_4dataEERT_c:
   38|  1.37k|    -> decltype(c.data()) {
   39|  1.37k|  return c.data();
   40|  1.37k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__16vectorIN13sentencepiece22SentencePieceProcessor11ExtraOptionENS3_9allocatorIS7_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  17.0k|    -> decltype(GetDataImpl(c, 0)) {
   51|  17.0k|  return GetDataImpl(c, 0);
   52|  17.0k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorIN13sentencepiece22SentencePieceProcessor11ExtraOptionENS3_9allocatorIS7_EEEEEEDTcldtfp_4dataEERT_c:
   38|  17.0k|    -> decltype(c.data()) {
   39|  17.0k|  return c.data();
   40|  17.0k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__16vectorImNS3_9allocatorImEEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  12.8k|    -> decltype(GetDataImpl(c, 0)) {
   51|  12.8k|  return GetDataImpl(c, 0);
   52|  12.8k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorImNS3_9allocatorImEEEEEEDTcldtfp_4dataEERT_c:
   38|  12.8k|    -> decltype(c.data()) {
   39|  12.8k|  return c.data();
   40|  12.8k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEDTcldtfp_4dataEERT_c:
   38|  37.4k|    -> decltype(c.data()) {
   39|  37.4k|  return c.data();
   40|  37.4k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  37.4k|    -> decltype(GetDataImpl(c, 0)) {
   51|  37.4k|  return GetDataImpl(c, 0);
   52|  37.4k|}
_ZN4absl12lts_2026081713span_internal7GetDataINSt3__15arrayIcLm15000EEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  22.4k|    -> decltype(GetDataImpl(c, 0)) {
   51|  22.4k|  return GetDataImpl(c, 0);
   52|  22.4k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplINSt3__15arrayIcLm15000EEEEEDTcldtfp_4dataEERT_c:
   38|  22.4k|    -> decltype(c.data()) {
   39|  22.4k|  return c.data();
   40|  22.4k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNS0_4SpanIcEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  7.49k|    -> decltype(GetDataImpl(c, 0)) {
   51|  7.49k|  return GetDataImpl(c, 0);
   52|  7.49k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNS0_4SpanIcEEEEDTcldtfp_4dataEERT_c:
   38|  7.49k|    -> decltype(c.data()) {
   39|  7.49k|  return c.data();
   40|  7.49k|}
_ZN4absl12lts_2026081713span_internal7GetDataINS0_13InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS5_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  7.49k|    -> decltype(GetDataImpl(c, 0)) {
   51|  7.49k|  return GetDataImpl(c, 0);
   52|  7.49k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplINS0_13InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS5_EEEEEEDTcldtfp_4dataEERT_c:
   38|  7.49k|    -> decltype(c.data()) {
   39|  7.49k|  return c.data();
   40|  7.49k|}
_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|  7.49k|    -> decltype(GetDataImpl(c, 0)) {
   51|  7.49k|  return GetDataImpl(c, 0);
   52|  7.49k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplINSt3__16vectorIPNS0_7LogSinkENS3_9allocatorIS6_EEEEEEDTcldtfp_4dataEERT_c:
   38|  7.49k|    -> decltype(c.data()) {
   39|  7.49k|  return c.data();
   40|  7.49k|}

_ZNK4absl12lts_202608174SpanIKNS0_19str_format_internal13FormatArgImplEE4sizeEv:
  321|  61.0k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIcE4sizeEv:
  321|  1.88M|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIcE4dataEv:
  316|   832k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIcE7subspanEmm:
  465|  82.4k|  constexpr Span subspan(size_type pos = 0, size_type len = npos) const {
  466|  82.4k|    return (pos <= size()) ? Span(data() + pos, (std::min)(size() - pos, len))
  ------------------
  |  Branch (466:12): [True: 82.4k, False: 0]
  ------------------
  467|  82.4k|                           : (ThrowStdOutOfRange("pos > size()"), Span());
  468|  82.4k|  }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE5beginEv:
  373|  1.37k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE4dataEv:
  316|  2.75k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE3endEv:
  386|  1.37k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE4sizeEv:
  321|  1.37k|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEC2INS0_10FixedArrayIS6_Lm128ENS2_9allocatorIS6_EEEEvSD_iEERKT_:
  252|  1.37k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEC2EPS7_m:
  228|  1.37k|      : ptr_(array), len_(length) {}
_ZNK4absl12lts_202608174SpanIKmEixEm:
  336|   380M|  constexpr reference operator[](size_type i) const noexcept {
  337|   380M|    absl::base_internal::HardeningAssertLT(i, size());
  338|   380M|    return ptr_[i];
  339|   380M|  }
_ZNK4absl12lts_202608174SpanIKmE4sizeEv:
  321|   571M|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEEC2INSt3__16vectorIS4_NS8_9allocatorIS4_EEEEvSC_iEERKT_:
  252|  17.0k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEEC2EPS5_m:
  228|  17.0k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIKmEC2INSt3__16vectorImNS5_9allocatorImEEEEvS9_iEERKT_:
  252|  12.8k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKmEC2EPS2_m:
  228|  12.8k|      : ptr_(array), len_(length) {}
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE4sizeEv:
  321|  2.75k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE5beginEv:
  373|  1.37k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE4dataEv:
  316|  2.75k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE3endEv:
  386|  1.37k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKiE4sizeEv:
  321|  2.80k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIKiE5beginEv:
  373|  1.40k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKiE4dataEv:
  316|  2.80k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKiE3endEv:
  386|  1.40k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE5beginEv:
  373|  17.0k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE4dataEv:
  316|  34.0k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE3endEv:
  386|  17.0k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE4sizeEv:
  321|  17.0k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE5emptyEv:
  331|  1.37k|  constexpr bool empty() const noexcept { return size() == 0; }
_ZNK4absl12lts_202608174SpanIKiE5emptyEv:
  331|  1.40k|  constexpr bool empty() const noexcept { return size() == 0; }
_ZNK4absl12lts_202608174SpanIKcE4dataEv:
  316|   262k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKcE4sizeEv:
  321|  2.60M|  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|  8.01k|      : Span(v.begin(), v.size()) {}
_ZN4absl12lts_202608174SpanIKNS0_19str_format_internal13FormatArgImplEEC2EPS4_m:
  228|  8.01k|      : 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|   157k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIcEC2Ev:
  225|  52.4k|  constexpr Span() noexcept : Span(nullptr, 0) {}
_ZN4absl12lts_202608174SpanIKcEC2Ev:
  225|  67.4k|  constexpr Span() noexcept : Span(nullptr, 0) {}
_ZN4absl12lts_202608174SpanIKcEC2EPS2_m:
  228|   254k|      : ptr_(array), len_(length) {}
_ZNK4absl12lts_202608174SpanIKcE5emptyEv:
  331|   224k|  constexpr bool empty() const noexcept { return size() == 0; }
_ZN4absl12lts_202608174SpanIcE13remove_prefixEm:
  430|   494k|  void remove_prefix(size_type n) noexcept {
  431|   494k|    absl::base_internal::HardeningAssertGE(size(), n);
  432|   494k|    ptr_ += n;
  433|   494k|    len_ -= n;
  434|   494k|  }
_ZN4absl12lts_202608174SpanIKcE13remove_prefixEm:
  430|   397k|  void remove_prefix(size_type n) noexcept {
  431|   397k|    absl::base_internal::HardeningAssertGE(size(), n);
  432|   397k|    ptr_ += n;
  433|   397k|    len_ -= n;
  434|   397k|  }
_ZN4absl12lts_202608174SpanIKcEC2INSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEvS9_TnNS5_9enable_ifIXsr6IsViewIT_EE5valueEiE4typeELi0EEERKSB_:
  267|  37.4k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608178MakeSpanITpTnRiJENSt3__15arrayIcLm15000EEEEENS3_9enable_ifIXntsr13span_internal6IsViewIT0_EE5valueEDTclsr4abslE8MakeSpanclsr13span_internalE7GetDatafp_Ecldtfp_4sizeEEEE4typeERS7_:
  751|  14.9k|                                                c.size()))> {
  752|  14.9k|  return MakeSpan(span_internal::GetData(c), c.size());
  753|  14.9k|}
_ZN4absl12lts_202608178MakeSpanITpTnRiJEcEENS0_4SpanIT0_EEPS4_m:
  727|  14.9k|                           size_t size) noexcept {
  728|  14.9k|  return Span<T>(ptr, size);
  729|  14.9k|}
_ZN4absl12lts_202608174SpanIKcEC2INS1_IcEEvS5_TnNSt3__19enable_ifIXsr6IsViewIT_EE5valueEiE4typeELi0EEERKS8_:
  267|  7.49k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608178MakeSpanITpTnRiJENS0_13InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS5_EEEEEENS6_9enable_ifIXntsr13span_internal6IsViewIT0_EE5valueEDTclsr4abslE8MakeSpanclsr13span_internalE7GetDatafp_Ecldtfp_4sizeEEEE4typeERSB_:
  751|  7.49k|                                                c.size()))> {
  752|  7.49k|  return MakeSpan(span_internal::GetData(c), c.size());
  753|  7.49k|}
_ZN4absl12lts_202608178MakeSpanITpTnRiJEPNS0_7LogSinkEEENS0_4SpanIT0_EEPS6_m:
  727|  14.9k|                           size_t size) noexcept {
  728|  14.9k|  return Span<T>(ptr, size);
  729|  14.9k|}
_ZN4absl12lts_202608174SpanIPNS0_7LogSinkEEC2EPS3_m:
  228|  14.9k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIcEC2INSt3__15arrayIcLm15000EEEvS6_iEERT_:
  244|  7.49k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIcE13remove_suffixEm:
  439|  7.49k|  void remove_suffix(size_type n) noexcept {
  440|  7.49k|    absl::base_internal::HardeningAssertGE(size(), n);
  441|  7.49k|    len_ -= n;
  442|  7.49k|  }
_ZNK4absl12lts_202608174SpanIcEixEm:
  336|   524k|  constexpr reference operator[](size_type i) const noexcept {
  337|   524k|    absl::base_internal::HardeningAssertLT(i, size());
  338|   524k|    return ptr_[i];
  339|   524k|  }
_ZNK4absl12lts_202608174SpanIKcEixEm:
  336|   809k|  constexpr reference operator[](size_type i) const noexcept {
  337|   809k|    absl::base_internal::HardeningAssertLT(i, size());
  338|   809k|    return ptr_[i];
  339|   809k|  }
_ZNK4absl12lts_202608174SpanIKcE7subspanEmm:
  465|   112k|  constexpr Span subspan(size_type pos = 0, size_type len = npos) const {
  466|   112k|    return (pos <= size()) ? Span(data() + pos, (std::min)(size() - pos, len))
  ------------------
  |  Branch (466:12): [True: 112k, False: 0]
  ------------------
  467|   112k|                           : (ThrowStdOutOfRange("pos > size()"), Span());
  468|   112k|  }
_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|  30.5k|  constexpr reference operator[](size_type i) const noexcept {
  337|  30.5k|    absl::base_internal::HardeningAssertLT(i, size());
  338|  30.5k|    return ptr_[i];
  339|  30.5k|  }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE5beginEv:
  373|  14.9k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE4dataEv:
  316|  29.9k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE3endEv:
  386|  14.9k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE4sizeEv:
  321|  14.9k|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608178MakeSpanITpTnRiJENSt3__16vectorIPNS0_7LogSinkENS3_9allocatorIS6_EEEEEENS3_9enable_ifIXntsr13span_internal6IsViewIT0_EE5valueEDTclsr4abslE8MakeSpanclsr13span_internalE7GetDatafp_Ecldtfp_4sizeEEEE4typeERSB_:
  751|  7.49k|                                                c.size()))> {
  752|  7.49k|  return MakeSpan(span_internal::GetData(c), c.size());
  753|  7.49k|}

_ZN6google8protobuf8internal7cleanup9ChunkList7CleanupERKNS1_11SerialArenaE:
  140|  8.54k|void ChunkList::Cleanup(const SerialArena& arena) {
  141|  8.54k|  Chunk* c = head_;
  142|  8.54k|  if (c == nullptr) return;
  ------------------
  |  Branch (142:7): [True: 8.54k, 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|   514k|void* SerialArena::AllocateAlignedFallback(size_t n) {
  265|   514k|  AllocateNewBlock(n);
  266|   514k|  void* ret = nullptr;
  267|   514k|  bool res = MaybeAllocateAligned(n, &ret);
  268|   514k|  ABSL_DCHECK(res);
  ------------------
  |  |   47|   514k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   514k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.02M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   514k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.02M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.02M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 514k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   514k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 514k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   514k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 514k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.02M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.02M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  269|   514k|  return ret;
  270|   514k|}
_ZN6google8protobuf8internal11SerialArena31AllocateFromStringBlockFallbackEv:
  273|   761k|void* SerialArena::AllocateFromStringBlockFallback() {
  274|   761k|  ABSL_DCHECK_EQ(string_block_unused_.load(std::memory_order_relaxed), 0U);
  ------------------
  |  |   74|   761k|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   761k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   761k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 761k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   761k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  275|   761k|  StringBlock* sb = string_block_.load(std::memory_order_relaxed);
  276|   761k|  if (sb) {
  ------------------
  |  Branch (276:7): [True: 753k, False: 8.54k]
  ------------------
  277|   753k|    AddSpaceUsed(sb->effective_size());
  278|   753k|  }
  279|       |
  280|   761k|  void* ptr;
  281|   761k|  StringBlock* new_sb;
  282|   761k|  size_t size = StringBlock::NextSize(sb);
  283|   761k|  if (MaybeAllocateAligned(size, &ptr)) {
  ------------------
  |  Branch (283:7): [True: 489k, False: 272k]
  ------------------
  284|       |    // Correct space_used_ to avoid double counting
  285|   489k|    AddSpaceUsed(-size);
  286|   489k|    new_sb = StringBlock::Emplace(ptr, size, sb);
  287|   489k|  } else {
  288|   272k|    new_sb = StringBlock::New(sb);
  289|   272k|    AddSpaceAllocated(new_sb->allocated_size());
  290|   272k|  }
  291|   761k|  string_block_.store(new_sb, std::memory_order_release);
  292|   761k|  size_t unused = new_sb->effective_size() - sizeof(std::string);
  293|   761k|  string_block_unused_.store(unused, std::memory_order_relaxed);
  294|   761k|  return new_sb->AtOffset(unused);
  295|   761k|}
_ZN6google8protobuf8internal11SerialArena16FreeStringBlocksEPNS1_11StringBlockEm:
  361|  8.54k|                                     size_t unused_bytes) {
  362|  8.54k|  ABSL_DCHECK(string_block != nullptr);
  ------------------
  |  |   47|  8.54k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|  8.54k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  17.0k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|  8.54k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  17.0k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  17.0k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 8.54k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|  8.54k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 8.54k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|  8.54k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 8.54k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  17.0k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  17.0k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  363|  8.54k|  StringBlock* next = string_block->next();
  364|  8.54k|  absl::PrefetchToLocalCacheNta(next);
  365|  8.54k|  std::string* end = string_block->end();
  366|   775k|  for (std::string* s = string_block->AtOffset(unused_bytes); s != end; ++s) {
  ------------------
  |  Branch (366:63): [True: 767k, False: 8.54k]
  ------------------
  367|   767k|    s->~basic_string();
  368|   767k|  }
  369|  8.54k|  size_t deallocated = StringBlock::Delete(string_block);
  370|       |
  371|   761k|  while ((string_block = next) != nullptr) {
  ------------------
  |  Branch (371:10): [True: 753k, False: 8.54k]
  ------------------
  372|   753k|    next = string_block->next();
  373|   753k|    absl::PrefetchToLocalCacheNta(next);
  374|   245M|    for (std::string& s : *string_block) {
  ------------------
  |  Branch (374:25): [True: 245M, False: 753k]
  ------------------
  375|   245M|      s.~basic_string();
  376|   245M|    }
  377|   753k|    deallocated += StringBlock::Delete(string_block);
  378|   753k|  }
  379|  8.54k|  return deallocated;
  380|  8.54k|}
_ZN6google8protobuf8internal15ThreadSafeArena22SentrySerialArenaChunkEv:
  532|  8.54k|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|  8.54k|  return reinterpret_cast<SerialArenaChunk*>(
  538|  8.54k|      const_cast<SerialArenaChunkHeader*>(&kSentryArenaChunk));
  539|  8.54k|}
_ZN6google8protobuf8internal15ThreadSafeArenaC2Ev:
  560|  8.54k|ThreadSafeArena::ThreadSafeArena() : first_arena_(*this) { Init(); }
_ZN6google8protobuf8internal15ThreadSafeArena18GetNextLifeCycleIdEv:
  649|  8.54k|uint64_t ThreadSafeArena::GetNextLifeCycleId() {
  650|  8.54k|  ThreadCache& tc = thread_cache();
  651|  8.54k|  uint64_t id = tc.next_lifecycle_id;
  652|  8.54k|  constexpr uint64_t kInc = ThreadCache::kPerThreadIds;
  653|  8.54k|  if (ABSL_PREDICT_FALSE((id & (kInc - 1)) == 0)) {
  ------------------
  |  |  190|  8.54k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 34, False: 8.51k]
  |  |  |  Branch (190:49): [Folded, False: 8.54k]
  |  |  |  Branch (190:58): [True: 34, False: 8.51k]
  |  |  ------------------
  ------------------
  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|     34|    id = lifecycle_id_.fetch_add(1, std::memory_order_relaxed) * kInc;
  658|     34|  }
  659|  8.54k|  tc.next_lifecycle_id = id + 1;
  660|  8.54k|  return id;
  661|  8.54k|}
_ZN6google8protobuf8internal15ThreadSafeArena4InitEv:
  730|  8.54k|void ThreadSafeArena::Init() {
  731|  8.54k|  tag_and_id_ = GetNextLifeCycleId();
  732|  8.54k|  arena_stats_ = Sample();
  733|  8.54k|  head_.store(SentrySerialArenaChunk(), std::memory_order_relaxed);
  734|  8.54k|  first_owner_ = &thread_cache();
  735|       |
  736|       |  // Record allocation for the first block that was either user-provided or
  737|       |  // newly allocated.
  738|  8.54k|  ThreadSafeArenaStats::RecordAllocateStats(
  739|  8.54k|      arena_stats_.MutableStats(),
  740|  8.54k|      /*used=*/0,
  741|  8.54k|      /*allocated=*/first_arena_.SpaceAllocated(),
  742|  8.54k|      /*wasted=*/0);
  743|       |
  744|  8.54k|  CacheSerialArena(&first_arena_);
  745|  8.54k|}
_ZN6google8protobuf8internal15ThreadSafeArenaD2Ev:
  747|  8.54k|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|  8.54k|  CleanupList();
  751|       |
  752|  8.54k|  auto mem = Free();
  753|  8.54k|  if (alloc_policy_.is_user_owned_initial_block()) {
  ------------------
  |  Branch (753:7): [True: 0, False: 8.54k]
  ------------------
  754|       |    // Unpoison the initial block, now that it's going back to the user.
  755|      0|    internal::UnpoisonMemoryRegion(mem.p, mem.n);
  756|  8.54k|  } else if (mem.n > 0) {
  ------------------
  |  Branch (756:14): [True: 0, False: 8.54k]
  ------------------
  757|      0|    GetDeallocator(alloc_policy_.get())(mem);
  758|      0|  }
  759|  8.54k|}
_ZN6google8protobuf8internal15ThreadSafeArena4FreeEv:
  761|  8.54k|SizedPtr ThreadSafeArena::Free() {
  762|  8.54k|  auto deallocator = GetDeallocator(alloc_policy_.get());
  763|       |
  764|  8.54k|  WalkSerialArenaChunk([&](SerialArenaChunk* chunk) {
  765|  8.54k|    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|  8.54k|    for (auto it = span.rbegin(); it != span.rend(); ++it) {
  770|  8.54k|      SerialArena* serial = it->load(std::memory_order_relaxed);
  771|  8.54k|      ABSL_DCHECK_NE(serial, nullptr);
  772|       |      // Always frees the first block of "serial" as it cannot be user-provided.
  773|  8.54k|      SizedPtr mem = serial->Free(deallocator);
  774|  8.54k|      ABSL_DCHECK_NE(mem.p, nullptr);
  775|  8.54k|      deallocator(mem);
  776|  8.54k|    }
  777|       |
  778|       |    // Delete the chunk as we're done with it.
  779|  8.54k|    internal::SizedDelete(chunk,
  780|  8.54k|                          SerialArenaChunk::AllocSize(chunk->capacity()));
  781|  8.54k|  });
  782|       |
  783|       |  // The first block of the first arena is special and let the caller handle it.
  784|  8.54k|  return first_arena_.Free(deallocator);
  785|  8.54k|}
_ZN6google8protobuf8internal15ThreadSafeArena23AllocateFromStringBlockEv:
  848|   245M|void* ThreadSafeArena::AllocateFromStringBlock() {
  849|   245M|  return GetSerialArena()->AllocateFromStringBlock();
  850|   245M|}
_ZN6google8protobuf8internal15ThreadSafeArena11CleanupListEv:
  926|  8.54k|void ThreadSafeArena::CleanupList() {
  927|       |  if constexpr (HasMemoryPoisoning()) {
  928|       |    UnpoisonAllArenaBlocks();
  929|       |  }
  930|       |
  931|  8.54k|  WalkSerialArenaChunk([](SerialArenaChunk* chunk) {
  932|  8.54k|    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|  8.54k|    for (auto it = span.rbegin(); it != span.rend(); ++it) {
  937|  8.54k|      SerialArena* serial = it->load(std::memory_order_relaxed);
  938|  8.54k|      ABSL_DCHECK_NE(serial, nullptr);
  939|  8.54k|      serial->CleanupList();
  940|  8.54k|    }
  941|  8.54k|  });
  942|       |  // First arena must be cleaned up last. (b/247560530)
  943|  8.54k|  first_arena_.CleanupList();
  944|  8.54k|}
_ZN6google8protobuf5Arena8AllocateEm:
  983|   150M|void* PROTOBUF_NONNULL Arena::Allocate(size_t n) {
  984|   150M|  return impl_.AllocateAligned(n);
  985|   150M|}
_ZN6google8protobuf5Arena16AllocateForArrayEm:
  987|   104k|void* PROTOBUF_NONNULL Arena::AllocateForArray(size_t n) {
  988|   104k|  return impl_.AllocateAligned<internal::AllocationClient::kArray>(n);
  989|   104k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_114AllocationSizeEmmm:
   54|   514k|                             size_t max_size) {
   55|   514k|  if (last_size == 0) return start_size;
  ------------------
  |  Branch (55:7): [True: 8.54k, False: 505k]
  ------------------
   56|       |  // Double the current block size, up to a limit.
   57|   505k|  return std::min(2 * last_size, max_size);
   58|   514k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_114AllocateMemoryERKNS1_16AllocationPolicyEm:
   60|   514k|SizedPtr AllocateMemory(const AllocationPolicy& policy, size_t size) {
   61|   514k|  if (policy.block_alloc == nullptr) {
  ------------------
  |  Branch (61:7): [True: 514k, False: 0]
  ------------------
   62|   514k|    return AllocateAtLeast(size);
   63|   514k|  }
   64|      0|  return {policy.block_alloc(size), size};
   65|   514k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_114GetDeallocatorC2EPKNS1_16AllocationPolicyE:
   95|  8.54k|      : dealloc_(policy ? policy->block_dealloc : nullptr) {}
  ------------------
  |  Branch (95:18): [True: 0, False: 8.54k]
  ------------------
arena.cc:_ZNK6google8protobuf8internal12_GLOBAL__N_114GetDeallocatorclENS1_8SizedPtrE:
   97|   514k|  void operator()(SizedPtr mem) const {
   98|   514k|    if (dealloc_) {
  ------------------
  |  Branch (98:9): [True: 0, False: 514k]
  ------------------
   99|      0|      dealloc_(mem.p, mem.n);
  100|   514k|    } else {
  101|   514k|      internal::SizedDelete(mem.p, mem.n);
  102|   514k|    }
  103|   514k|  }
_ZN6google8protobuf8internal11SerialArena16AllocateNewBlockEm:
  305|   514k|void SerialArena::AllocateNewBlock(size_t n) {
  306|   514k|  size_t used = 0;
  307|   514k|  size_t wasted = 0;
  308|   514k|  ArenaBlock* old_head = head();
  309|   514k|  if (!old_head->IsSentry()) {
  ------------------
  |  Branch (309:7): [True: 505k, False: 8.54k]
  ------------------
  310|       |    // Record how much used in this block.
  311|   505k|    used = static_cast<size_t>(ptr() - old_head->Pointer(kBlockHeaderSize));
  312|   505k|    wasted = old_head->size - used - kBlockHeaderSize;
  313|   505k|    AddSpaceUsed(used);
  314|   505k|  }
  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|   514k|  auto mem = AllocateBlock(parent_.AllocPolicy(), old_head->size, n);
  322|   514k|  AddSpaceAllocated(mem.n);
  323|   514k|  ThreadSafeArenaStats::RecordAllocateStats(parent_.arena_stats_.MutableStats(),
  324|   514k|                                            /*used=*/used,
  325|   514k|                                            /*allocated=*/mem.n, wasted);
  326|   514k|  auto* new_head = new (mem.p) ArenaBlock{old_head, mem.n};
  327|   514k|  set_range(new_head->Pointer(kBlockHeaderSize), new_head->Limit());
  328|       |  // Previous writes must take effect before writing new head.
  329|   514k|  head_.store(new_head, std::memory_order_release);
  330|       |
  331|   514k|  internal::PoisonMemoryRegion(ptr(), limit_ - ptr());
  332|   514k|}
_ZN6google8protobuf8internal11SerialArenaC2ERNS1_15ThreadSafeArenaE:
  210|  8.54k|    : head_{SentryArenaBlock()}, parent_{parent} {}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_116SentryArenaBlockEv:
   48|  8.54k|ArenaBlock* SentryArenaBlock() {
   49|       |  // const_cast<> is okay as kSentryArenaBlock will never be mutated.
   50|  8.54k|  return const_cast<ArenaBlock*>(&kSentryArenaBlock);
   51|  8.54k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_113AllocateBlockEPKNS1_16AllocationPolicyEmm:
   68|   514k|                       size_t min_bytes) {
   69|   514k|  AllocationPolicy policy;  // default policy
   70|   514k|  if (policy_ptr) policy = *policy_ptr;
  ------------------
  |  Branch (70:7): [True: 0, False: 514k]
  ------------------
   71|   514k|  size_t size =
   72|   514k|      AllocationSize(last_size, policy.start_block_size, policy.max_block_size);
   73|       |  // Verify that min_bytes + kBlockHeaderSize won't overflow.
   74|   514k|  ABSL_CHECK_LE(min_bytes, std::numeric_limits<size_t>::max() -
  ------------------
  |  |   54|   514k|  ABSL_LOG_INTERNAL_CHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   53|   514k|  ABSL_LOG_INTERNAL_CHECK_OP(Check_LE, <=, val1, val1_text, val2, val2_text)
  |  |  |  |  ------------------
  |  |  |  |  |  |   68|   514k|  while (const char* absl_nullable absl_log_internal_check_op_result           \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (68:36): [True: 0, False: 514k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   69|   514k|         [[maybe_unused]] = ::absl::log_internal::name##Impl(                  \
  |  |  |  |  |  |   70|   514k|             ::absl::log_internal::GetReferenceableValue(val1),                \
  |  |  |  |  |  |   71|   514k|             ::absl::log_internal::GetReferenceableValue(val2),                \
  |  |  |  |  |  |   72|   514k|             ABSL_LOG_INTERNAL_STRIP_STRING_LITERAL(val1_text " " #op          \
  |  |  |  |  |  |   73|   514k|                                                              " " val2_text))) \
  |  |  |  |  |  |   74|   514k|    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|   514k|                               SerialArena::kBlockHeaderSize);
   76|   514k|  size = std::max(size, SerialArena::kBlockHeaderSize + min_bytes);
   77|       |
   78|   514k|  return AllocateMemory(policy, size);
   79|   514k|}
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk8IsSentryEv:
  431|  17.0k|  bool IsSentry() const { return capacity() == 0; }
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk8capacityEv:
  441|  17.0k|  uint32_t capacity() const { return header().capacity; }
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk6headerEv:
  511|  17.0k|  const SerialArenaChunkHeader& header() const {
  512|  17.0k|    return *layout_type::Partial().Pointer<kHeader>(ptr());
  513|  17.0k|  }
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk3ptrEv:
  505|  17.0k|  const char* ptr() const { return reinterpret_cast<const char*>(this); }
arena.cc:_ZN6google8protobuf8internal11SerialArena4FreeINS1_12_GLOBAL__N_114GetDeallocatorEEENS1_8SizedPtrET_:
  250|  8.54k|SizedPtr SerialArena::Free(Deallocator deallocator) {
  251|  8.54k|  FreeStringBlocks();
  252|       |
  253|  8.54k|  ArenaBlock* b = head();
  254|  8.54k|  SizedPtr mem = {b, b->size};
  255|   523k|  while (b->next) {
  ------------------
  |  Branch (255:10): [True: 514k, False: 8.54k]
  ------------------
  256|   514k|    b = b->next;  // We must first advance before deleting this block
  257|   514k|    deallocator(mem);
  258|   514k|    mem = {b, b->size};
  259|   514k|  }
  260|  8.54k|  return mem;
  261|  8.54k|}
arena.cc:_ZN6google8protobuf8internal15ThreadSafeArena20WalkSerialArenaChunkIZNS2_4FreeEvE3$_0EEvT_:
  864|  8.54k|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|  8.54k|  SerialArenaChunk* chunk = head_.load(std::memory_order_relaxed);
  869|       |
  870|  8.54k|  while (!chunk->IsSentry()) {
  ------------------
  |  Branch (870:10): [True: 0, False: 8.54k]
  ------------------
  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|  8.54k|}
arena.cc:_ZN6google8protobuf8internal15ThreadSafeArena20WalkSerialArenaChunkIZNS2_11CleanupListEvE3$_0EEvT_:
  864|  8.54k|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|  8.54k|  SerialArenaChunk* chunk = head_.load(std::memory_order_relaxed);
  869|       |
  870|  8.54k|  while (!chunk->IsSentry()) {
  ------------------
  |  Branch (870:10): [True: 0, False: 8.54k]
  ------------------
  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|  8.54k|}

_ZN6google8protobuf5ArenaC2Ev:
  293|  8.54k|  inline Arena() : impl_() {}
_ZN6google8protobuf5ArenaD2Ev:
  318|  8.54k|  inline ~Arena() = default;
_ZN6google8protobuf5Arena16DefaultConstructIN13sentencepiece31SentencePieceText_SentencePieceEEEPvPS1_:
 1134|   150M|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|   150M|  } else {
 1151|   150M|    static_assert(is_destructor_skippable<T>::value);
 1152|   150M|    void* mem = arena != nullptr ? arena->AllocateAligned(sizeof(T))
  ------------------
  |  Branch (1152:17): [True: 150M, False: 0]
  ------------------
 1153|   150M|                                 : internal::Allocate(sizeof(T));
 1154|       |    if constexpr (internal::HasDeprecatedArenaConstructor<T>()) {
 1155|       |      return new (mem) T(internal::InternalVisibility(), arena);
 1156|   150M|    } else {
 1157|   150M|      return new (mem) T(arena);
 1158|   150M|    }
 1159|   150M|  }
 1160|   150M|}
_ZN6google8protobuf5Arena15AllocateAlignedEmm:
  406|   150M|  AllocateAligned(size_t size, size_t align = 8) {
  407|   150M|    if (align <= internal::ArenaAlignDefault::align) {
  ------------------
  |  Branch (407:9): [True: 150M, False: 0]
  ------------------
  408|   150M|      return Allocate(internal::ArenaAlignDefault::Ceil(size));
  409|   150M|    } 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|   150M|  }
_ZN6google8protobuf5Arena16DefaultConstructIN13sentencepiece17SentencePieceTextEEEPvPS1_:
 1134|  12.8k|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|  12.8k|  } else {
 1151|  12.8k|    static_assert(is_destructor_skippable<T>::value);
 1152|  12.8k|    void* mem = arena != nullptr ? arena->AllocateAligned(sizeof(T))
  ------------------
  |  Branch (1152:17): [True: 12.8k, False: 0]
  ------------------
 1153|  12.8k|                                 : internal::Allocate(sizeof(T));
 1154|       |    if constexpr (internal::HasDeprecatedArenaConstructor<T>()) {
 1155|       |      return new (mem) T(internal::InternalVisibility(), arena);
 1156|  12.8k|    } else {
 1157|  12.8k|      return new (mem) T(arena);
 1158|  12.8k|    }
 1159|  12.8k|  }
 1160|  12.8k|}
_ZN6google8protobuf5Arena6CreateIN13sentencepiece22NBestSentencePieceTextEJEEEPT_PS1_DpOT0_:
  330|  3.98k|      Create(Arena* PROTOBUF_NULLABLE arena, Args&&... args) {
  331|  3.98k|    if constexpr (is_arena_constructable<T>::value) {
  332|  3.98k|      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|  3.98k|      if constexpr (is_destructor_skippable<T>::value) {
  338|  3.98k|        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|  3.98k|        if constexpr (construct_type == ConstructType::kDefault) {
  344|  3.98k|          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|  3.98k|      }
  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|  3.98k|  }
_ZN6google8protobuf5Arena16DefaultConstructIN13sentencepiece22NBestSentencePieceTextEEEPvPS1_:
 1134|  3.98k|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|  3.98k|  } else {
 1151|  3.98k|    static_assert(is_destructor_skippable<T>::value);
 1152|  3.98k|    void* mem = arena != nullptr ? arena->AllocateAligned(sizeof(T))
  ------------------
  |  Branch (1152:17): [True: 3.98k, False: 0]
  ------------------
 1153|  3.98k|                                 : internal::Allocate(sizeof(T));
 1154|       |    if constexpr (internal::HasDeprecatedArenaConstructor<T>()) {
 1155|       |      return new (mem) T(internal::InternalVisibility(), arena);
 1156|  3.98k|    } else {
 1157|  3.98k|      return new (mem) T(arena);
 1158|  3.98k|    }
 1159|  3.98k|  }
 1160|  3.98k|}
_ZN6google8protobuf5Arena6CreateIN13sentencepiece17SentencePieceTextEJEEEPT_PS1_DpOT0_:
  330|  4.55k|      Create(Arena* PROTOBUF_NULLABLE arena, Args&&... args) {
  331|  4.55k|    if constexpr (is_arena_constructable<T>::value) {
  332|  4.55k|      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.55k|      if constexpr (is_destructor_skippable<T>::value) {
  338|  4.55k|        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.55k|        if constexpr (construct_type == ConstructType::kDefault) {
  344|  4.55k|          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.55k|      }
  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.55k|  }
_ZN6google8protobuf5Arena17ReturnArrayMemoryEPvm:
  695|  89.2k|  void ReturnArrayMemory(void* PROTOBUF_NONNULL p, size_t size) {
  696|  89.2k|    impl_.ReturnArrayMemory(p, size);
  697|  89.2k|  }
_ZN6google8protobuf5Arena23AllocateAlignedForArrayEmm:
  804|   104k|  void* PROTOBUF_NONNULL AllocateAlignedForArray(size_t n, size_t align) {
  805|   104k|    if (align <= internal::ArenaAlignDefault::align) {
  ------------------
  |  Branch (805:9): [True: 104k, False: 0]
  ------------------
  806|   104k|      return AllocateForArray(internal::ArenaAlignDefault::Ceil(n));
  807|   104k|    } 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|   104k|  }
_ZN6google8protobuf5Arena16AllocateInternalINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEELb0EEEPvv:
 1191|   245M|inline void* PROTOBUF_NONNULL Arena::AllocateInternal<std::string, false>() {
 1192|   245M|  return impl_.AllocateFromStringBlock();
 1193|   245M|}
_ZN6google8protobuf5Arena6CreateINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJEEEPT_PS1_DpOT0_:
  330|   130M|      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|   130M|    } else {
  351|   130M|      if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  ------------------
  |  |  190|   130M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 130M]
  |  |  |  Branch (190:49): [Folded, False: 130M]
  |  |  |  Branch (190:58): [True: 0, False: 130M]
  |  |  ------------------
  ------------------
  352|      0|        return new T(std::forward<Args>(args)...);
  353|      0|      }
  354|   130M|      return new (arena->AllocateInternal<T>()) T(std::forward<Args>(args)...);
  355|   130M|    }
  356|   130M|  }
_ZN6google8protobuf5Arena6CreateINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJPKcmEEEPT_PS1_DpOT0_:
  330|   115M|      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|   115M|    } else {
  351|   115M|      if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  ------------------
  |  |  190|   115M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 115M]
  |  |  |  Branch (190:49): [Folded, False: 115M]
  |  |  |  Branch (190:58): [True: 0, False: 115M]
  |  |  ------------------
  ------------------
  352|      0|        return new T(std::forward<Args>(args)...);
  353|      0|      }
  354|   115M|      return new (arena->AllocateInternal<T>()) T(std::forward<Args>(args)...);
  355|   115M|    }
  356|   115M|  }
_ZN6google8protobuf5Arena11CreateArrayIcEEPT_PS1_m:
  429|   104k|      CreateArray(Arena* PROTOBUF_NULLABLE arena, size_t num_elements) {
  430|   104k|    static_assert(std::is_trivially_default_constructible_v<T>,
  431|   104k|                  "CreateArray requires a trivially constructible type");
  432|   104k|    static_assert(std::is_trivially_destructible_v<T>,
  433|   104k|                  "CreateArray requires a trivially destructible type");
  434|   104k|    ABSL_CHECK_LE(num_elements,
  ------------------
  |  |   54|      0|  ABSL_LOG_INTERNAL_CHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   53|   104k|  ABSL_LOG_INTERNAL_CHECK_OP(Check_LE, <=, val1, val1_text, val2, val2_text)
  |  |  |  |  ------------------
  |  |  |  |  |  |   68|   104k|  while (const char* absl_nullable absl_log_internal_check_op_result           \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (68:36): [True: 0, False: 104k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   69|   104k|         [[maybe_unused]] = ::absl::log_internal::name##Impl(                  \
  |  |  |  |  |  |   70|   104k|             ::absl::log_internal::GetReferenceableValue(val1),                \
  |  |  |  |  |  |   71|   104k|             ::absl::log_internal::GetReferenceableValue(val2),                \
  |  |  |  |  |  |   72|   104k|             ABSL_LOG_INTERNAL_STRIP_STRING_LITERAL(val1_text " " #op          \
  |  |  |  |  |  |   73|   104k|                                                              " " val2_text))) \
  |  |  |  |  |  |   74|   104k|    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|   104k|  ABSL_LOG_INTERNAL_CHECK(::absl::implicit_cast<const char* absl_nonnull>(     \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|   104k|  ::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|   104k|    if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  ------------------
  |  |  190|   104k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 104k]
  |  |  |  Branch (190:49): [Folded, False: 104k]
  |  |  |  Branch (190:58): [True: 0, False: 104k]
  |  |  ------------------
  ------------------
  439|      0|      return new T[num_elements];
  440|   104k|    } else {
  441|       |      // We count on compiler to realize that if sizeof(T) is a multiple of
  442|       |      // 8 AlignUpTo can be elided.
  443|   104k|      return static_cast<T*>(
  444|   104k|          arena->AllocateAlignedForArray(sizeof(T) * num_elements, alignof(T)));
  445|   104k|    }
  446|   104k|  }

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

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

_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|   115M|void ArenaStringPtr::Set(absl::string_view value, Arena* arena) {
  106|   115M|  ScopedCheckPtrInvariants check(&tagged_ptr_);
  107|   115M|  if (IsDefault()) {
  ------------------
  |  Branch (107:7): [True: 115M, False: 0]
  ------------------
  108|       |    // If we're not on an arena, skip straight to a true string to avoid
  109|       |    // possible copy cost later.
  110|   115M|    tagged_ptr_ = arena != nullptr ? CreateArenaString(*arena, value)
  ------------------
  |  Branch (110:19): [True: 115M, False: 0]
  ------------------
  111|   115M|                                   : CreateString(value);
  112|   115M|  } 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|   115M|}
_ZN6google8protobuf8internal14ArenaStringPtr7MutableEPNS0_5ArenaE:
  169|   130M|std::string* ArenaStringPtr::Mutable(Arena* arena) {
  170|   130M|  ScopedCheckPtrInvariants check(&tagged_ptr_);
  171|   130M|  if (tagged_ptr_.IsMutable()) {
  ------------------
  |  Branch (171:7): [True: 0, False: 130M]
  ------------------
  172|      0|    return tagged_ptr_.Get();
  173|   130M|  } else {
  174|   130M|    return MutableSlow(arena);
  175|   130M|  }
  176|   130M|}
_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|   115M|TaggedStringPtr CreateArenaString(Arena& arena, absl::string_view s) {
   86|   115M|  TaggedStringPtr res;
   87|   115M|  res.SetMutableArena(Arena::Create<std::string>(&arena, s.data(), s.length()));
   88|   115M|  return res;
   89|   115M|}
_ZN6google8protobuf8internal24ScopedCheckPtrInvariantsC2EPKNS1_15TaggedStringPtrE:
   97|   245M|  explicit ScopedCheckPtrInvariants(const TaggedStringPtr*) {}
_ZN6google8protobuf8internal14ArenaStringPtr11MutableSlowIJEEEPNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEPNS0_5ArenaEDpRKT_:
  201|   130M|                                         const Lazy&... lazy_default) {
  202|   130M|  ABSL_DCHECK(IsDefault());
  ------------------
  |  |   47|   130M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   130M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   260M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   130M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   260M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   260M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 130M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   130M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 130M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   130M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 130M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   260M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   260M|  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|   130M|  return NewString(arena, lazy_default.get()...);
  208|   130M|}

_ZNK6google8protobuf8internal14ArenaStringPtr3GetEv:
  338|   134M|  PROTOBUF_NDEBUG_INLINE const std::string& Get() const {
  339|       |    // Unconditionally mask away the tag.
  340|   134M|    return *tagged_ptr_.Get();
  341|   134M|  }
_ZNK6google8protobuf8internal15TaggedStringPtr3GetEv:
  164|   134M|  inline std::string* Get() const {
  165|   134M|    return reinterpret_cast<std::string*>(as_int() & ~kMask);
  166|   134M|  }
_ZNK6google8protobuf8internal15TaggedStringPtr6as_intEv:
  200|   380M|  uintptr_t as_int() const { return reinterpret_cast<uintptr_t>(ptr_); }
_ZNK6google8protobuf8internal14ArenaStringPtr9IsDefaultEv:
  395|   115M|  inline bool IsDefault() const { return tagged_ptr_.IsDefault(); }
_ZNK6google8protobuf8internal15TaggedStringPtr9IsDefaultEv:
  141|   115M|  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|   115M|inline void ArenaStringPtr::Set(const char* s, size_t n, Arena* arena) {
  485|   115M|  Set(absl::string_view{s, n}, arena);
  486|   115M|}
_ZN6google8protobuf8internal15TaggedStringPtrC2EPKNS1_26GlobalEmptyStringConstexprE:
  108|   301M|      : 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|   245M|  inline std::string* SetMutableArena(std::string* p) {
  134|   245M|    return TagAs(kMutableArena, p);
  135|   245M|  }
_ZNK6google8protobuf8internal15TaggedStringPtr9IsMutableEv:
  138|   130M|  inline bool IsMutable() const { return as_int() & kMutableBit; }
_ZN6google8protobuf8internal15TaggedStringPtr14assert_alignedEPKv:
  183|   245M|  static inline void assert_aligned(const void* p) {
  184|   245M|    static_assert(kMask <= alignof(void*), "Pointer underaligned for bit mask");
  185|   245M|    static_assert(kMask <= alignof(std::string),
  186|   245M|                  "std::string underaligned for bit mask");
  187|   245M|    ABSL_DCHECK_EQ(reinterpret_cast<uintptr_t>(p) & kMask, 0UL);
  ------------------
  |  |   74|   245M|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   245M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   245M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 245M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   245M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  188|   245M|  }
_ZN6google8protobuf8internal15TaggedStringPtr5TagAsENS2_4TypeEPNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEE:
  193|   245M|  inline std::string* TagAs(Type type, std::string* p) {
  194|   245M|    ABSL_DCHECK(p != nullptr);
  ------------------
  |  |   47|   245M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   245M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   491M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   245M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   491M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   491M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 245M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   245M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 245M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   245M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 245M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   491M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   491M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  195|   245M|    assert_aligned(p);
  196|   245M|    ptr_ = reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(p) | type);
  197|   245M|    return p;
  198|   245M|  }
_ZN6google8protobuf8internal14ArenaStringPtrC2EPNS0_5ArenaE:
  243|   301M|      : tagged_ptr_(&fixed_address_empty_string) {
  244|   301M|    if (DebugHardenForceCopyDefaultString()) {
  ------------------
  |  Branch (244:9): [Folded, False: 301M]
  ------------------
  245|      0|      Set(absl::string_view(""), arena);
  246|      0|    }
  247|   301M|  }
_ZN6google8protobuf8internal14ArenaStringPtr9NewStringIJEEEPNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEPNS0_5ArenaEDpOT_:
  399|   130M|  inline std::string* NewString(Arena* arena, Args&&... args) {
  400|   130M|    if (arena == nullptr) {
  ------------------
  |  Branch (400:9): [True: 596, False: 130M]
  ------------------
  401|    596|      auto* s = new std::string(std::forward<Args>(args)...);
  402|    596|      return tagged_ptr_.SetAllocated(s);
  403|   130M|    } else {
  404|   130M|      auto* s = Arena::Create<std::string>(arena, std::forward<Args>(args)...);
  405|   130M|      return tagged_ptr_.SetMutableArena(s);
  406|   130M|    }
  407|   130M|  }

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

_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|  4.56k|void ExtensionSet::Clear() {
  763|  4.56k|  ForEach([](int /* number */, Extension& ext) { ext.Clear(); }, Prefetch{});
  764|  4.56k|}
_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.16k|  bool is_large() const { return static_cast<int16_t>(flat_size_) < 0; }
_ZN6google8protobuf8internal12ExtensionSet10flat_beginEv:
 1210|  4.56k|  KeyValue* flat_begin() {
 1211|       |    assert(!is_large());
 1212|  4.56k|    return map_.flat;
 1213|  4.56k|  }
_ZNK6google8protobuf8internal12ExtensionSet10flat_beginEv:
 1214|    602|  const KeyValue* flat_begin() const {
 1215|       |    assert(!is_large());
 1216|    602|    return map_.flat;
 1217|    602|  }
_ZN6google8protobuf8internal12ExtensionSet8flat_endEv:
 1218|  4.56k|  KeyValue* flat_end() {
 1219|       |    assert(!is_large());
 1220|  4.56k|    return map_.flat + flat_size_;
 1221|  4.56k|  }
_ZNK6google8protobuf8internal12ExtensionSet8flat_endEv:
 1222|    602|  const KeyValue* flat_end() const {
 1223|       |    assert(!is_large());
 1224|    602|    return map_.flat + flat_size_;
 1225|    602|  }
_ZN6google8protobuf8internal12ExtensionSetC2Ev:
  265|   150M|  constexpr ExtensionSet() = default;
extension_set.cc:_ZN6google8protobuf8internal12ExtensionSet7ForEachIZNS2_5ClearEvE3$_0NS2_8PrefetchEEEvT_T0_:
  964|  4.56k|  void ForEach(KeyValueFunctor func, PrefetchFunctor prefetch_func) {
  965|  4.56k|    if (ABSL_PREDICT_FALSE(is_large())) {
  ------------------
  |  |  190|  4.56k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 4.56k]
  |  |  |  Branch (190:49): [Folded, False: 4.56k]
  |  |  |  Branch (190:58): [True: 0, False: 4.56k]
  |  |  ------------------
  ------------------
  966|      0|      ForEachPrefetchImpl(map_.large->begin(), map_.large->end(),
  967|      0|                          std::move(func), std::move(prefetch_func));
  968|      0|      return;
  969|      0|    }
  970|  4.56k|    ForEachPrefetchImpl(flat_begin(), flat_end(), std::move(func),
  971|  4.56k|                        std::move(prefetch_func));
  972|  4.56k|  }
extension_set.cc:_ZN6google8protobuf8internal12ExtensionSet19ForEachPrefetchImplIPNS2_8KeyValueEZNS2_5ClearEvE3$_0NS2_8PrefetchEEEvT_S8_T0_T1_:
  939|  4.56k|                                  PrefetchFunctor prefetch_func) {
  940|       |    // Note: based on arena's ChunkList::Cleanup().
  941|       |    // Prefetch distance 16 performs better than 8 in load tests.
  942|  4.56k|    constexpr int kPrefetchDistance = 16;
  943|  4.56k|    Iterator prefetch = it;
  944|       |    // Prefetch the first kPrefetchDistance extensions.
  945|  4.56k|    for (int i = 0; prefetch != end && i < kPrefetchDistance; ++prefetch, ++i) {
  ------------------
  |  Branch (945:21): [True: 0, False: 4.56k]
  |  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|  4.56k|    for (; prefetch != end; ++it, ++prefetch) {
  ------------------
  |  Branch (950:12): [True: 0, False: 4.56k]
  ------------------
  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|  4.56k|    for (; it != end; ++it) func(it->first, it->second);
  ------------------
  |  Branch (955:12): [True: 0, False: 4.56k]
  ------------------
  956|  4.56k|  }

_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|   849M|  PROTOBUF_NDEBUG_INLINE uint32_t& operator[](int index) {
   46|   849M|    return has_bits_[index];
   47|   849M|  }
_ZNK6google8protobuf8internal7HasBitsILi1EEixEi:
   50|      8|  operator[](int index) const {
   51|      8|    return has_bits_[index];
   52|      8|  }
_ZNK6google8protobuf8internal7HasBitsILi2EEixEi:
   50|  2.77k|  operator[](int index) const {
   51|  2.77k|    return has_bits_[index];
   52|  2.77k|  }
_ZN6google8protobuf8internal7HasBitsILi1EEC2Ev:
   35|   150M|  PROTOBUF_NDEBUG_INLINE constexpr HasBits() : has_bits_{} {}
_ZN6google8protobuf8internal7HasBitsILi1EE5ClearEv:
   41|  8.54k|  PROTOBUF_NDEBUG_INLINE void Clear() {
   42|  8.54k|    memset(has_bits_, 0, sizeof(has_bits_));
   43|  8.54k|  }

_ZNK6google8protobuf8internal22InternalMetadataOffset6OffsetEv:
  150|  16.8k|  constexpr int32_t Offset() const { return offset_; }
_ZN6google8protobuf8internal22InternalMetadataOffsetC2Ei:
  155|  16.8k|  explicit constexpr InternalMetadataOffset(int32_t offset) : offset_(offset) {}
_ZN6google8protobuf8internal22InternalMetadataOffset5BuildIN13sentencepiece17SentencePieceTextELm40EEES2_v:
   38|  12.8k|  static constexpr PROTOBUF_ALWAYS_INLINE InternalMetadataOffset Build() {
   39|  12.8k|    static_assert(
   40|  12.8k|        std::is_same_v<std::remove_const_t<decltype(T::_internal_metadata_)>,
   41|  12.8k|                       InternalMetadata>,
   42|  12.8k|        "Field `_internal_metadata_ is not of type `InternalMetadata`");
   43|       |
   44|  12.8k|    constexpr int64_t kInternalMetadataOffset =
   45|  12.8k|        static_cast<int64_t>(PROTOBUF_FIELD_OFFSET(T, _internal_metadata_));
  ------------------
  |  |  311|  12.8k|  _Pragma("clang diagnostic push")                           \
  |  |  312|  12.8k|  _Pragma("clang diagnostic ignored \"-Winvalid-offsetof\"") \
  |  |  313|  12.8k|  __builtin_offsetof(TYPE, FIELD)                            \
  |  |  314|  12.8k|  _Pragma("clang diagnostic pop")
  ------------------
   46|       |
   47|  12.8k|    static_assert(
   48|  12.8k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) >=
   49|  12.8k|            int64_t{INT32_MIN},
   50|  12.8k|        "Offset from `_internal_metadata_` is underflowing an int32_t, "
   51|  12.8k|        "likely meaning your message body is too large.");
   52|  12.8k|    static_assert(
   53|  12.8k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) <=
   54|  12.8k|            int64_t{INT32_MAX},
   55|  12.8k|        "Offset from `_internal_metadata_` is overflowing an int32_t, "
   56|  12.8k|        "likely meaning your message body is too large.");
   57|       |
   58|  12.8k|    return InternalMetadataOffset(
   59|  12.8k|        static_cast<int32_t>(kInternalMetadataOffset - kFieldOffset));
   60|  12.8k|  }
_ZN6google8protobuf8internal30TaggedInternalMetadataResolverILj0EEC2ENS1_22InternalMetadataOffsetE:
  173|  16.8k|      : offset_(static_cast<uint32_t>(offset.Offset())) {
  174|  16.8k|    ABSL_DCHECK_EQ(offset_ & kTagMask, uint32_t{0});
  ------------------
  |  |   74|  16.8k|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|  16.8k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  16.8k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 16.8k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  16.8k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  175|  16.8k|  }
_ZN6google8protobuf8internal22InternalMetadataOffset5BuildIN13sentencepiece22NBestSentencePieceTextELm24EEES2_v:
   38|  3.98k|  static constexpr PROTOBUF_ALWAYS_INLINE InternalMetadataOffset Build() {
   39|  3.98k|    static_assert(
   40|  3.98k|        std::is_same_v<std::remove_const_t<decltype(T::_internal_metadata_)>,
   41|  3.98k|                       InternalMetadata>,
   42|  3.98k|        "Field `_internal_metadata_ is not of type `InternalMetadata`");
   43|       |
   44|  3.98k|    constexpr int64_t kInternalMetadataOffset =
   45|  3.98k|        static_cast<int64_t>(PROTOBUF_FIELD_OFFSET(T, _internal_metadata_));
  ------------------
  |  |  311|  3.98k|  _Pragma("clang diagnostic push")                           \
  |  |  312|  3.98k|  _Pragma("clang diagnostic ignored \"-Winvalid-offsetof\"") \
  |  |  313|  3.98k|  __builtin_offsetof(TYPE, FIELD)                            \
  |  |  314|  3.98k|  _Pragma("clang diagnostic pop")
  ------------------
   46|       |
   47|  3.98k|    static_assert(
   48|  3.98k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) >=
   49|  3.98k|            int64_t{INT32_MIN},
   50|  3.98k|        "Offset from `_internal_metadata_` is underflowing an int32_t, "
   51|  3.98k|        "likely meaning your message body is too large.");
   52|  3.98k|    static_assert(
   53|  3.98k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) <=
   54|  3.98k|            int64_t{INT32_MAX},
   55|  3.98k|        "Offset from `_internal_metadata_` is overflowing an int32_t, "
   56|  3.98k|        "likely meaning your message body is too large.");
   57|       |
   58|  3.98k|    return InternalMetadataOffset(
   59|  3.98k|        static_cast<int32_t>(kInternalMetadataOffset - kFieldOffset));
   60|  3.98k|  }
_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|   301M|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|   849M|      uint32_t& cached_has_bits, uint32_t has_bit_mask) {
  892|   849M|    cached_has_bits |= has_bit_mask;
  893|   849M|  }
_ZN6google8protobuf8internal18MessageGlobalsBase17ToDefaultInstanceIN13sentencepiece14NormalizerSpecEEEPKT_PKv:
  261|      2|  static const T* ToDefaultInstance(const void* globals) {
  262|      2|    return reinterpret_cast<const T*>(globals);
  263|      2|  }
_ZN6google8protobuf11MessageLite11CheckHasBitEjj:
  901|  6.77k|      uint32_t cached_has_bits, uint32_t has_bit_mask) {
  902|  6.77k|    return (cached_has_bits & has_bit_mask) != 0;
  903|  6.77k|  }
_ZN6google8protobuf11MessageLite19internal_visibilityEv:
  788|   301M|  static constexpr internal::InternalVisibility internal_visibility() {
  789|   301M|    return internal::InternalVisibility{};
  790|   301M|  }
_ZNK6google8protobuf11MessageLite8GetArenaEv:
  419|   396M|  [[nodiscard]] Arena* GetArena() const { return _internal_metadata_.arena(); }
_ZN6google8protobuf8internal10CachedSizeC2Ev:
  126|   150M|  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|   150M|  explicit MessageLite(Arena* arena) : _internal_metadata_(arena) {}
_ZN6google8protobuf11MessageLite16BatchCheckHasBitEjj:
  906|  4.56k|      uint32_t cached_has_bits, uint32_t batch_has_bits_mask) {
  907|  4.56k|    return (cached_has_bits & batch_has_bits_mask) != 0;
  908|  4.56k|  }
_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|   396M|  PROTOBUF_NDEBUG_INLINE Arena* arena() const {
   68|   396M|    if (ABSL_PREDICT_FALSE(have_unknown_fields())) {
  ------------------
  |  |  190|   396M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 396M]
  |  |  |  Branch (190:49): [Folded, False: 396M]
  |  |  |  Branch (190:58): [True: 0, False: 396M]
  |  |  ------------------
  ------------------
   69|      0|      return PtrValue<ContainerBase>()->arena;
   70|   396M|    } else {
   71|   396M|      return PtrValue<Arena>();
   72|   396M|    }
   73|   396M|  }
_ZNK6google8protobuf8internal16InternalMetadata19have_unknown_fieldsEv:
   75|   396M|  PROTOBUF_NDEBUG_INLINE bool have_unknown_fields() const {
   76|   396M|    return HasUnknownFieldsTag();
   77|   396M|  }
_ZNK6google8protobuf8internal16InternalMetadata19HasUnknownFieldsTagEv:
  143|   396M|  PROTOBUF_ALWAYS_INLINE bool HasUnknownFieldsTag() const {
  144|   396M|    return ptr_ & kUnknownFieldsTagMask;
  145|   396M|  }
_ZNK6google8protobuf8internal16InternalMetadata8PtrValueINS0_5ArenaEEEPT_v:
  148|   396M|  U* PtrValue() const {
  149|   396M|    if constexpr (std::is_same_v<U, Arena>) {
  150|       |      // No mask to remove.
  151|   396M|      ABSL_DCHECK_EQ(ptr_ & kPtrTagMask, 0);
  ------------------
  |  |   74|   396M|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   396M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   396M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 396M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   396M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  152|   396M|      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|   396M|  }
_ZN6google8protobuf8internal16InternalMetadataC2EPNS0_5ArenaE:
   48|   150M|  explicit InternalMetadata(Arena* arena) {
   49|   150M|    ptr_ = reinterpret_cast<intptr_t>(arena);
   50|   150M|  }
_ZN6google8protobuf8internal16InternalMetadata5ClearINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEvv:
  128|  8.54k|  PROTOBUF_NDEBUG_INLINE void Clear() {
  129|  8.54k|    if (ABSL_PREDICT_FALSE(have_unknown_fields())) {
  ------------------
  |  |  190|  8.54k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 8.54k]
  |  |  |  Branch (190:49): [Folded, False: 8.54k]
  |  |  |  Branch (190:58): [True: 0, False: 8.54k]
  |  |  ------------------
  ------------------
  130|      0|      DoClear<T>();
  131|      0|    }
  132|  8.54k|  }

_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|  1.52G|PROTOBUF_ALWAYS_INLINE void TSanRead(const void*) {}
_ZN6google8protobuf8internal9TSanWriteEPKv:
  731|   849M|PROTOBUF_ALWAYS_INLINE void TSanWrite(const void*) {}
_ZN6google8protobuf8internal8AllocateEm:
  141|   787k|PROTOBUF_ALWAYS_INLINE PROTOBUF_MALLOC void* Allocate(size_t size) {
  142|   787k|#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|   787k|  return __builtin_operator_new(size);
  146|       |#else
  147|       |  return ::operator new(size);
  148|       |#endif
  149|   787k|}
_ZN6google8protobuf8internal16NoopDebugCounter6IncLogEm:
  824|    600|  constexpr void IncLog(uint64_t) {}
_ZNK6google8protobuf8internal26GlobalEmptyStringConstexpr4InitEv:
  867|      2|  std::string* Init() const { return nullptr; }
_ZN6google8protobuf8internal15AllocateAtLeastEm:
  155|   514k|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|   514k|  return {Allocate(size), size};
  163|   514k|}
_ZN6google8protobuf8internal11SizedDeleteEPvm:
  165|   786k|inline void SizedDelete(void* p, size_t size) {
  166|   786k|#if defined(__cpp_sized_deallocation)
  167|   786k|  ::operator delete(p, size);
  168|       |#else
  169|       |  // Avoid -Wunused-parameter
  170|       |  (void)size;
  171|       |  ::operator delete(p);
  172|       |#endif
  173|   786k|}
_ZN6google8protobuf8internal18PoisonMemoryRegionEPKvm:
  639|   591k|                               [[maybe_unused]] size_t n) {
  640|       |#if defined(ABSL_HAVE_ADDRESS_SANITIZER)
  641|       |  ASAN_POISON_MEMORY_REGION(p, n);
  642|       |#else
  643|       |  // Nothing
  644|   591k|#endif
  645|   591k|}
_ZN6google8protobuf8internal20UnpoisonMemoryRegionEPKvm:
  648|   151M|                                 [[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|   151M|#endif
  671|   151M|}
_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|   104k|inline int CalculateReserveSize(int capacity, int new_size) {
 1503|   104k|  constexpr int lower_limit =
 1504|   104k|      RepeatedFieldLowerClampLimit<T, kHeapRepHeaderSize>();
 1505|   104k|  if (new_size < lower_limit) {
  ------------------
  |  Branch (1505:7): [True: 0, False: 104k]
  ------------------
 1506|       |    // Clamp to smallest allowed size.
 1507|      0|    return lower_limit;
 1508|      0|  }
 1509|   104k|  constexpr int kMaxSizeBeforeClamp =
 1510|   104k|      (std::numeric_limits<int>::max() - kHeapRepHeaderSize) / 2;
 1511|   104k|  if (ABSL_PREDICT_FALSE(capacity > kMaxSizeBeforeClamp)) {
  ------------------
  |  |  190|   104k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 104k]
  |  |  |  Branch (190:49): [Folded, False: 104k]
  |  |  |  Branch (190:58): [True: 0, False: 104k]
  |  |  ------------------
  ------------------
 1512|      0|    return std::numeric_limits<int>::max();
 1513|      0|  }
 1514|   104k|  constexpr int kSooCapacityElements = SooCapacityElements<T>();
 1515|   104k|  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|   104k|  } else {
 1520|   209k|    ABSL_DCHECK(capacity == 0 || capacity >= lower_limit)
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   104k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   104k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   209k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   209k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 104k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   104k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 104k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   104k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 104k, 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|   104k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|   104k|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1521|   209k|        << capacity << " " << lower_limit;
 1522|   104k|  }
 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|   104k|  int doubled_size = 2 * capacity + kHeapRepHeaderSize / sizeof(T);
 1527|   104k|  return std::max(doubled_size, new_size);
 1528|   104k|}

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

_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE4sizeEv:
 1740|  17.4M|inline int RepeatedPtrField<Element>::size() const {
 1741|  17.4M|  return RepeatedPtrFieldBase::size();
 1742|  17.4M|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase4sizeEv:
  227|   450M|  int size() const {
  228|   450M|    int res = current_size_;
  229|   450M|    PROTOBUF_ASSUME(res >= 0);
  ------------------
  |  |  733|   450M|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  230|   450M|    return res;
  231|   450M|  }
_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|   432M|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|   432M|  ABSL_DCHECK_GE(index, 0);
  ------------------
  |  |   82|   432M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   432M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   432M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 432M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   432M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  140|   432M|  ABSL_DCHECK_LT(index, size);
  ------------------
  |  |   80|   432M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|   432M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   432M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 432M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   432M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  141|   432M|}
_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|   432M|  void*& element_at(int index) {
  783|   432M|    if (using_sso()) {
  ------------------
  |  Branch (783:9): [True: 0, False: 432M]
  ------------------
  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|   432M|    return rep()->elements[index];
  788|   432M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase9using_ssoEv:
  806|   885M|  bool using_sso() const {
  807|   885M|    return (reinterpret_cast<uintptr_t>(tagged_rep_or_elem_) & 1) == 0;
  808|   885M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase3repEv:
  797|   885M|  Rep* rep() {
  798|   885M|    ABSL_DCHECK(!using_sso());
  ------------------
  |  |   47|   885M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   885M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.77G|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   885M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.77G|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.77G|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 885M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   885M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 885M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   885M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 885M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.77G|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.77G|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  799|   885M|    return reinterpret_cast<Rep*>(
  800|   885M|        reinterpret_cast<uintptr_t>(tagged_rep_or_elem_) - 1);
  801|   885M|  }
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE20InternalAddWithArenaENS0_8internal18InternalVisibilityEPNS0_5ArenaE:
 1776|   150M|    internal::InternalVisibility, Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1777|   150M|  return AddWithArena(arena);
 1778|   150M|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE12AddWithArenaEPNS0_5ArenaE:
 1782|   150M|    Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1783|   150M|  return RepeatedPtrFieldBase::Add<TypeHandler>(arena);
 1784|   150M|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase3AddINS1_18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEEEEEPNT_4TypeEPNS0_5ArenaE:
  265|   150M|  Value<TypeHandler>* Add(Arena* arena) {
  266|   150M|    return cast<TypeHandler>(AddInternal(arena, TypeHandler::GetNewFunc()));
  267|   150M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEEEEEPNT_4TypeEPv:
  811|   150M|  static inline Value<TypeHandler>* cast(void* element) {
  812|   150M|    return reinterpret_cast<Value<TypeHandler>*>(element);
  813|   150M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase11AddInternalEPNS0_5ArenaEN4absl12lts_2026081711FunctionRefIFvS4_RPvEEE:
  910|   150M|    Arena* arena, absl::FunctionRef<ElementNewFn> factory) {
  911|   150M|  ABSL_DCHECK_EQ(arena, GetArena());
  ------------------
  |  |   74|   150M|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   150M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   150M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 150M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   150M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  912|   150M|  if (tagged_rep_or_elem_ == nullptr) {
  ------------------
  |  Branch (912:7): [True: 16.7k, False: 150M]
  ------------------
  913|  16.7k|    ExchangeCurrentSize(1);
  914|  16.7k|    factory(arena, tagged_rep_or_elem_);
  915|  16.7k|    return tagged_rep_or_elem_;
  916|  16.7k|  }
  917|   150M|  absl::PrefetchToLocalCache(tagged_rep_or_elem_);
  918|   150M|  if (using_sso()) {
  ------------------
  |  Branch (918:7): [True: 15.3k, False: 150M]
  ------------------
  919|  15.3k|    if (current_size_ == 0) {
  ------------------
  |  Branch (919:9): [True: 0, False: 15.3k]
  ------------------
  920|      0|      ExchangeCurrentSize(1);
  921|      0|      return tagged_rep_or_elem_;
  922|      0|    }
  923|  15.3k|    void*& result = *InternalExtend(1, arena);
  924|  15.3k|    factory(arena, result);
  925|  15.3k|    Rep* r = rep();
  926|  15.3k|    r->allocated_size = 2;
  927|  15.3k|    ExchangeCurrentSize(2);
  928|  15.3k|    return result;
  929|  15.3k|  }
  930|   150M|  Rep* r = rep();
  931|   150M|  if (ABSL_PREDICT_FALSE(SizeAtCapacity())) {
  ------------------
  |  |  190|   150M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 89.2k, False: 150M]
  |  |  |  Branch (190:49): [Folded, False: 150M]
  |  |  |  Branch (190:58): [True: 89.2k, False: 150M]
  |  |  ------------------
  ------------------
  932|  89.2k|    InternalExtend(1, arena);
  933|  89.2k|    r = rep();
  934|   150M|  } else {
  935|   150M|    if (ClearedCount() > 0) {
  ------------------
  |  Branch (935:9): [True: 0, False: 150M]
  ------------------
  936|      0|      return r->elements[ExchangeCurrentSize(current_size_ + 1)];
  937|      0|    }
  938|   150M|  }
  939|   150M|  ++r->allocated_size;
  940|   150M|  void*& result = r->elements[ExchangeCurrentSize(current_size_ + 1)];
  941|   150M|  factory(arena, result);
  942|   150M|  return result;
  943|   150M|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase19ExchangeCurrentSizeEi:
  759|   150M|  inline int ExchangeCurrentSize(int new_size) {
  760|   150M|    return std::exchange(current_size_, new_size);
  761|   150M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase14SizeAtCapacityEv:
  762|   150M|  inline bool SizeAtCapacity() const {
  763|       |    // Harden invariant size() <= allocated_size() <= Capacity().
  764|   150M|    ABSL_DCHECK_LE(size(), allocated_size());
  ------------------
  |  |   78|   150M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|   150M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   150M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 150M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   150M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  765|   150M|    ABSL_DCHECK_LE(allocated_size(), Capacity());
  ------------------
  |  |   78|   150M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|   150M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   150M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 150M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   150M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  766|   150M|    return current_size_ == Capacity();
  767|   150M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8CapacityEv:
  238|   150M|  int Capacity() const {
  239|   150M|    int res = using_sso() ? kSSOCapacity : rep()->capacity;
  ------------------
  |  Branch (239:15): [True: 15.3k, False: 150M]
  ------------------
  240|   150M|    PROTOBUF_ASSUME(res >= 0);
  ------------------
  |  |  733|   150M|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  241|   150M|    return res;
  242|   150M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase3repEv:
  802|   301M|  const Rep* rep() const {
  803|   301M|    return const_cast<RepeatedPtrFieldBase*>(this)->rep();
  804|   301M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase12ClearedCountEv:
  642|   150M|  int ClearedCount() const { return allocated_size() - current_size_; }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase14allocated_sizeEv:
  793|   150M|  int allocated_size() const {
  794|   150M|    return using_sso() ? (tagged_rep_or_elem_ != nullptr ? 1 : 0)
  ------------------
  |  Branch (794:12): [True: 0, False: 150M]
  |  Branch (794:27): [True: 0, False: 0]
  ------------------
  795|   150M|                       : rep()->allocated_size;
  796|   150M|  }
_ZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEv:
 1059|   150M|  static constexpr auto GetNewFunc() {
 1060|   150M|    return [](Arena* arena, void*& ptr) {
 1061|   150M|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|   150M|    };
 1063|   150M|  }
_ZZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvENKUlPNS0_5ArenaERPvE_clES7_S9_:
 1060|   150M|    return [](Arena* arena, void*& ptr) {
 1061|   150M|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|   150M|    };
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE20InternalAddWithArenaENS0_8internal18InternalVisibilityEPNS0_5ArenaE:
 1776|  8.29k|    internal::InternalVisibility, Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1777|  8.29k|  return AddWithArena(arena);
 1778|  8.29k|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE12AddWithArenaEPNS0_5ArenaE:
 1782|  8.29k|    Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1783|  8.29k|  return RepeatedPtrFieldBase::Add<TypeHandler>(arena);
 1784|  8.29k|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase3AddINS1_18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEEEEEPNT_4TypeEPNS0_5ArenaE:
  265|  8.29k|  Value<TypeHandler>* Add(Arena* arena) {
  266|  8.29k|    return cast<TypeHandler>(AddInternal(arena, TypeHandler::GetNewFunc()));
  267|  8.29k|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEEEEEPNT_4TypeEPv:
  811|  8.29k|  static inline Value<TypeHandler>* cast(void* element) {
  812|  8.29k|    return reinterpret_cast<Value<TypeHandler>*>(element);
  813|  8.29k|  }
_ZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEv:
 1059|  8.29k|  static constexpr auto GetNewFunc() {
 1060|  8.29k|    return [](Arena* arena, void*& ptr) {
 1061|  8.29k|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|  8.29k|    };
 1063|  8.29k|  }
_ZZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvENKUlPNS0_5ArenaERPvE_clES7_S9_:
 1060|  8.29k|    return [](Arena* arena, void*& ptr) {
 1061|  8.29k|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|  8.29k|    };
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase10element_atEi:
  789|   432M|  const void* element_at(int index) const {
  790|   432M|    return const_cast<RepeatedPtrFieldBase*>(this)->element_at(index);
  791|   432M|  }
_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|  24.4k|inline int RepeatedPtrField<Element>::size() const {
 1741|  24.4k|  return RepeatedPtrFieldBase::size();
 1742|  24.4k|}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE4sizeEv:
 1740|  7.97k|inline int RepeatedPtrField<Element>::size() const {
 1741|  7.97k|  return RepeatedPtrFieldBase::size();
 1742|  7.97k|}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE5beginEv:
 2409|  3.98k|RepeatedPtrField<Element>::begin() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2410|  3.98k|  return iterator(raw_data());
 2411|  3.98k|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8raw_dataEv:
  489|  33.6k|  void* const* raw_data() const { return elements(); }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8elementsEv:
  775|  33.6k|  void* const* elements() const {
  776|  33.6k|    return using_sso() ? &tagged_rep_or_elem_ : +rep()->elements;
  ------------------
  |  Branch (776:12): [True: 2.91k, False: 30.7k]
  ------------------
  777|  33.6k|  }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIN13sentencepiece17SentencePieceTextEEC2EPKPv:
 2169|  7.97k|  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEC2IS4_vEERKNS2_IT_EE:
 2177|  7.97k|      : it_(other.it_) {}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE3endEv:
 2424|  3.98k|RepeatedPtrField<Element>::end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2425|  3.98k|  return iterator(raw_data() + size());
 2426|  3.98k|}
_ZN6google8protobuf8internalneERKNS1_19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEES8_:
 2203|  12.2k|  friend bool operator!=(const iterator& x, const iterator& y) {
 2204|  12.2k|    return x.it_ != y.it_;
 2205|  12.2k|  }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEppEv:
 2188|  8.29k|  iterator& operator++() {
 2189|  8.29k|    ++it_;
 2190|  8.29k|    return *this;
 2191|  8.29k|  }
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEdeEv:
 2180|  8.29k|  PROTOBUF_FUTURE_ADD_NODISCARD reference operator*() const {
 2181|  8.29k|    return *reinterpret_cast<Element*>(*it_);
 2182|  8.29k|  }
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE5beginEv:
 2409|  12.8k|RepeatedPtrField<Element>::begin() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2410|  12.8k|  return iterator(raw_data());
 2411|  12.8k|}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIN13sentencepiece31SentencePieceText_SentencePieceEEC2EPKPv:
 2169|  25.7k|  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEC2IS4_vEERKNS2_IT_EE:
 2177|  25.7k|      : it_(other.it_) {}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE3endEv:
 2424|  12.8k|RepeatedPtrField<Element>::end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2425|  12.8k|  return iterator(raw_data() + size());
 2426|  12.8k|}
_ZN6google8protobuf8internalneERKNS1_19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEES8_:
 2203|   150M|  friend bool operator!=(const iterator& x, const iterator& y) {
 2204|   150M|    return x.it_ != y.it_;
 2205|   150M|  }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEppEv:
 2188|   150M|  iterator& operator++() {
 2189|   150M|    ++it_;
 2190|   150M|    return *this;
 2191|   150M|  }
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEdeEv:
 2180|   150M|  PROTOBUF_FUTURE_ADD_NODISCARD reference operator*() const {
 2181|   150M|    return *reinterpret_cast<Element*>(*it_);
 2182|   150M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBaseC2ENS1_22InternalMetadataOffsetE:
  211|  16.8k|      : 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|   432M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1747|   432M|  return RepeatedPtrFieldBase::Get<TypeHandler>(index);
 1748|   432M|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase3GetINS1_18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEEEEERKNT_4TypeEi:
  354|   432M|  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|   432M|    RuntimeAssertInBounds(index, size());
  367|   432M|    return *cast<TypeHandler>(element_at(index));
  368|   432M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEEEEEPKNT_4TypeEPKv:
  815|   432M|  static inline const Value<TypeHandler>* cast(const void* element) {
  816|   432M|    return reinterpret_cast<const Value<TypeHandler>*>(element);
  817|   432M|  }
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEEC2ENS0_8internal18InternalVisibilityENS5_22InternalMetadataOffsetE:
 1236|  12.8k|      : RepeatedPtrField(offset) {}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEEC2ENS0_8internal22InternalMetadataOffsetE:
 1627|  12.8k|    : 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|  12.8k|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEEC2ENS0_8internal18InternalVisibilityENS5_22InternalMetadataOffsetE:
 1236|  3.98k|      : RepeatedPtrField(offset) {}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEEC2ENS0_8internal22InternalMetadataOffsetE:
 1627|  3.98k|    : 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|  3.98k|}
_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|   514k|  ArenaBlock(ArenaBlock* next, size_t size) : next(next), size(size) {
   44|   514k|    ABSL_DCHECK_GT(size, sizeof(ArenaBlock));
  ------------------
  |  |   84|   514k|  ABSL_LOG_INTERNAL_DCHECK_GT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   97|   514k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   514k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 514k]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   514k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   45|   514k|  }
_ZN6google8protobuf8internal10ArenaBlock7PointerEm:
   47|  1.53M|  char* Pointer(size_t n) {
   48|  1.53M|    ABSL_DCHECK_LE(n, size);
  ------------------
  |  |   78|  1.53M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|  1.53M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  1.53M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 1.53M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  1.53M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   49|  1.53M|    return reinterpret_cast<char*>(this) + n;
   50|  1.53M|  }
_ZN6google8protobuf8internal10ArenaBlock5LimitEv:
   51|   514k|  char* Limit() { return Pointer(size & static_cast<size_t>(-8)); }
_ZNK6google8protobuf8internal10ArenaBlock8IsSentryEv:
   53|   514k|  bool IsSentry() const { return size == 0; }
_ZN6google8protobuf8internal11SerialArena11CleanupListEv:
   85|  8.54k|  void CleanupList() { cleanup_list_.Cleanup(*this); }
_ZNK6google8protobuf8internal11SerialArena14SpaceAllocatedEv:
   86|  8.54k|  uint64_t SpaceAllocated() const {
   87|  8.54k|    return space_allocated_.load(std::memory_order_relaxed);
   88|  8.54k|  }
_ZN6google8protobuf8internal11SerialArena26TryAllocateFromCachedBlockEm:
   92|   104k|  PROTOBUF_ALWAYS_INLINE void* TryAllocateFromCachedBlock(size_t size) {
   93|   104k|    if (ABSL_PREDICT_FALSE(size < 16)) return nullptr;
  ------------------
  |  |  190|   104k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 104k]
  |  |  |  Branch (190:49): [Folded, False: 104k]
  |  |  |  Branch (190:58): [True: 0, False: 104k]
  |  |  ------------------
  ------------------
   94|       |    // We round up to the next larger block in case the memory doesn't match
   95|       |    // the pattern we are looking for.
   96|   104k|    const size_t index = absl::bit_width(size - 1) - 4;
   97|       |
   98|   104k|    if (ABSL_PREDICT_FALSE(index >= cached_block_length_)) return nullptr;
  ------------------
  |  |  190|   104k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 29.6k, False: 74.9k]
  |  |  |  Branch (190:49): [Folded, False: 104k]
  |  |  |  Branch (190:58): [True: 29.6k, False: 74.9k]
  |  |  ------------------
  ------------------
   99|  74.9k|    auto& cached_head = cached_blocks_[index];
  100|  74.9k|    if (cached_head == nullptr) return nullptr;
  ------------------
  |  Branch (100:9): [True: 46.0k, False: 28.9k]
  ------------------
  101|       |
  102|  28.9k|    void* ret = cached_head;
  103|  28.9k|    internal::UnpoisonMemoryRegion(ret, size);
  104|  28.9k|    cached_head = cached_head->next;
  105|  28.9k|    return ret;
  106|  74.9k|  }
_ZN6google8protobuf8internal11SerialArena17ReturnArrayMemoryEPvm:
  151|  89.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|  89.2k|    if (sizeof(void*) < 8) {
  ------------------
  |  Branch (155:9): [Folded, False: 89.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|  89.2k|    } else {
  158|  89.2k|      PROTOBUF_ASSUME(size >= 16);
  ------------------
  |  |  733|  89.2k|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  159|  89.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|  89.2k|    const size_t index = absl::bit_width(size) - 5;
  165|       |
  166|  89.2k|    if (ABSL_PREDICT_FALSE(index >= cached_block_length_)) {
  ------------------
  |  |  190|  89.2k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 14.2k, False: 74.9k]
  |  |  |  Branch (190:49): [Folded, False: 89.2k]
  |  |  |  Branch (190:58): [True: 14.2k, False: 74.9k]
  |  |  ------------------
  ------------------
  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|  14.2k|      CachedBlock** new_list = static_cast<CachedBlock**>(p);
  171|  14.2k|      size_t new_size = size / sizeof(CachedBlock*);
  172|       |
  173|  14.2k|      std::copy(cached_blocks_, cached_blocks_ + cached_block_length_,
  174|  14.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|  14.2k|      internal::UnpoisonMemoryRegion(
  179|  14.2k|          new_list + cached_block_length_,
  180|  14.2k|          (new_size - cached_block_length_) * sizeof(CachedBlock*));
  181|       |
  182|  14.2k|      std::fill(new_list + cached_block_length_, new_list + new_size, nullptr);
  183|       |
  184|  14.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|  14.2k|      cached_block_length_ =
  188|  14.2k|          static_cast<uint8_t>(std::min(size_t{64}, new_size));
  189|       |
  190|  14.2k|      return;
  191|  14.2k|    }
  192|       |
  193|  74.9k|    auto& cached_head = cached_blocks_[index];
  194|  74.9k|    auto* new_node = static_cast<CachedBlock*>(p);
  195|  74.9k|    new_node->next = cached_head;
  196|  74.9k|    cached_head = new_node;
  197|  74.9k|    internal::PoisonMemoryRegion(p, size);
  198|  74.9k|  }
_ZN6google8protobuf8internal11SerialArena20MaybeAllocateAlignedEmPPv:
  201|   152M|  bool MaybeAllocateAligned(size_t n, void** out) {
  202|   152M|    ABSL_DCHECK(internal::ArenaAlignDefault::IsAligned(n));
  ------------------
  |  |   47|   152M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   152M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   304M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   152M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   304M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   304M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 152M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   152M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 152M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   152M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 152M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   304M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   304M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  203|   152M|    ABSL_DCHECK_GE(limit_, ptr());
  ------------------
  |  |   82|   152M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   152M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   152M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 152M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   152M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  204|   152M|    char* ret = ptr();
  205|   152M|    if (ABSL_PREDICT_FALSE(limit_ - ret < static_cast<ptrdiff_t>(n))) {
  ------------------
  |  |  190|   152M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 786k, False: 151M]
  |  |  |  Branch (190:49): [Folded, False: 152M]
  |  |  |  Branch (190:58): [True: 786k, False: 151M]
  |  |  ------------------
  ------------------
  206|   786k|      return false;
  207|   786k|    }
  208|   151M|    internal::UnpoisonMemoryRegion(ret, n);
  209|   151M|    *out = ret;
  210|   151M|    char* next = ret + n;
  211|   151M|    set_ptr(next);
  212|   151M|    MaybePrefetchData(next);
  213|   151M|    return true;
  214|   152M|  }
_ZN6google8protobuf8internal11SerialArena17MaybePrefetchImplElPKcS4_S4_:
  281|   151M|                                       const char* prefetch_ptr) {
  282|   151M|    if (ABSL_PREDICT_TRUE(prefetch_ptr - next > prefetch_degree))
  ------------------
  |  |  191|   151M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 133M, False: 18.0M]
  |  |  |  Branch (191:48): [Folded, False: 151M]
  |  |  |  Branch (191:57): [True: 133M, False: 18.0M]
  |  |  ------------------
  ------------------
  283|   133M|      return prefetch_ptr;
  284|  18.0M|    if (ABSL_PREDICT_TRUE(prefetch_ptr < limit)) {
  ------------------
  |  |  191|  18.0M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 11.6M, False: 6.45M]
  |  |  |  Branch (191:48): [Folded, False: 18.0M]
  |  |  |  Branch (191:57): [True: 11.6M, False: 6.45M]
  |  |  ------------------
  ------------------
  285|  11.6M|      prefetch_ptr = std::max(next, prefetch_ptr);
  286|  11.6M|      ABSL_DCHECK(prefetch_ptr != nullptr);
  ------------------
  |  |   47|  11.6M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|  11.6M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  23.2M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|  11.6M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  23.2M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  23.2M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 11.6M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|  11.6M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 11.6M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|  11.6M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 11.6M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  23.2M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  23.2M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  287|  11.6M|      const char* end = std::min(limit, prefetch_ptr + prefetch_degree);
  288|   193M|      for (; prefetch_ptr < end; prefetch_ptr += ABSL_CACHELINE_SIZE) {
  ------------------
  |  |   89|   181M|#define ABSL_CACHELINE_SIZE 64
  ------------------
  |  Branch (288:14): [True: 181M, False: 11.6M]
  ------------------
  289|   181M|        absl::PrefetchToLocalCacheForWrite(prefetch_ptr);
  290|   181M|      }
  291|  11.6M|    }
  292|  18.0M|    return prefetch_ptr;
  293|  18.0M|  }
_ZN6google8protobuf8internal11SerialArena17MaybePrefetchDataEPKc:
  295|   151M|  void MaybePrefetchData(const char* next) {
  296|   151M|    ABSL_DCHECK(static_cast<const void*>(prefetch_ptr_) == ptr() ||
  ------------------
  |  |   47|   151M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   151M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   302M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   151M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   302M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   302M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 151M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   151M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 151M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   151M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 151M, 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|   302M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   302M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  297|   151M|                static_cast<const void*>(prefetch_ptr_) >= head());
  298|   151M|    prefetch_ptr_ =
  299|   151M|        MaybePrefetchImpl(kPrefetchDataDegree, next, limit_, prefetch_ptr_);
  300|   151M|  }
_ZN6google8protobuf8internal11SerialArena16FreeStringBlocksEv:
  322|  8.54k|  size_t FreeStringBlocks() {
  323|       |    // On the active block delete all strings skipping the unused instances.
  324|  8.54k|    size_t unused_bytes = string_block_unused_.load(std::memory_order_relaxed);
  325|  8.54k|    if (StringBlock* sb = string_block_.load(std::memory_order_relaxed)) {
  ------------------
  |  Branch (325:22): [True: 8.54k, False: 0]
  ------------------
  326|  8.54k|      return FreeStringBlocks(sb, unused_bytes);
  327|  8.54k|    }
  328|      0|    return 0;
  329|  8.54k|  }
_ZN6google8protobuf8internal11SerialArena12AddSpaceUsedEm:
  333|  1.74M|  void AddSpaceUsed(size_t space_used) {
  334|  1.74M|    space_used_.store(space_used_.load(std::memory_order_relaxed) + space_used,
  335|  1.74M|                      std::memory_order_relaxed);
  336|  1.74M|  }
_ZN6google8protobuf8internal11SerialArena17AddSpaceAllocatedEm:
  339|   786k|  void AddSpaceAllocated(size_t space_allocated) {
  340|   786k|    space_allocated_.store(
  341|   786k|        space_allocated_.load(std::memory_order_relaxed) + space_allocated,
  342|   786k|        std::memory_order_relaxed);
  343|   786k|  }
_ZN6google8protobuf8internal11SerialArena4headEv:
  346|   523k|  ArenaBlock* head() { return head_.load(std::memory_order_relaxed); }
_ZN6google8protobuf8internal11SerialArena3ptrEv:
  351|   153M|  char* ptr() { return ptr_.load(std::memory_order_relaxed); }
_ZN6google8protobuf8internal11SerialArena7set_ptrEPc:
  353|   151M|  void set_ptr(char* ptr) { return ptr_.store(ptr, std::memory_order_relaxed); }
_ZN6google8protobuf8internal11SerialArena9set_rangeEPcS3_:
  354|   514k|  PROTOBUF_ALWAYS_INLINE void set_range(char* ptr, char* limit) {
  355|   514k|    set_ptr(ptr);
  356|   514k|    prefetch_ptr_ = ptr;
  357|   514k|    limit_ = limit;
  358|   514k|  }
_ZN6google8protobuf8internal11SerialArena31ArbitraryInternalPointerForInitEv:
  373|  25.6k|  static char* ArbitraryInternalPointerForInit() {
  374|       |    // Use rodata to detect potential bugs. No one should be writing here.
  375|  25.6k|    alignas(8) static constexpr char dummy{};
  376|  25.6k|    return const_cast<char*>(&dummy);
  377|  25.6k|  }
_ZN6google8protobuf8internal11SerialArena19MaybeAllocateStringERPv:
  422|   245M|PROTOBUF_ALWAYS_INLINE bool SerialArena::MaybeAllocateString(void*& p) {
  423|       |  // Check how many unused instances are in the current block.
  424|   245M|  size_t unused_bytes = string_block_unused_.load(std::memory_order_relaxed);
  425|   245M|  if (ABSL_PREDICT_TRUE(unused_bytes != 0)) {
  ------------------
  |  |  191|   245M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 245M, False: 761k]
  |  |  |  Branch (191:48): [Folded, False: 245M]
  |  |  |  Branch (191:57): [True: 245M, False: 761k]
  |  |  ------------------
  ------------------
  426|   245M|    unused_bytes -= sizeof(std::string);
  427|   245M|    string_block_unused_.store(unused_bytes, std::memory_order_relaxed);
  428|   245M|    p = string_block_.load(std::memory_order_relaxed)->AtOffset(unused_bytes);
  429|   245M|    return true;
  430|   245M|  }
  431|   761k|  return false;
  432|   245M|}
_ZN6google8protobuf8internal11SerialArena23AllocateFromStringBlockEv:
  435|   245M|SerialArena::AllocateFromStringBlock() {
  436|   245M|  void* p;
  437|   245M|  if (ABSL_PREDICT_TRUE(MaybeAllocateString(p))) return p;
  ------------------
  |  |  191|   245M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 245M, False: 761k]
  |  |  |  Branch (191:48): [Folded, False: 245M]
  |  |  |  Branch (191:57): [True: 245M, False: 761k]
  |  |  ------------------
  ------------------
  438|   761k|  return AllocateFromStringBlockFallback();
  439|   245M|}
_ZN6google8protobuf8internal11SerialArena15AllocateAlignedILNS1_16AllocationClientE1EEEPvm:
  116|   104k|  void* AllocateAligned(size_t n) {
  117|   104k|    ABSL_DCHECK(internal::ArenaAlignDefault::IsAligned(n));
  ------------------
  |  |   47|   104k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   104k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   209k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   104k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   209k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   209k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 104k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   104k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 104k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   104k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 104k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   209k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   209k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  118|   104k|    ABSL_DCHECK_GE(limit_, ptr());
  ------------------
  |  |   82|   104k|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   104k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   104k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 104k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   104k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  119|       |
  120|   104k|    if (alloc_client == AllocationClient::kArray) {
  ------------------
  |  Branch (120:9): [True: 104k, Folded]
  ------------------
  121|   104k|      if (void* res = TryAllocateFromCachedBlock(n)) {
  ------------------
  |  Branch (121:17): [True: 28.9k, False: 75.6k]
  ------------------
  122|  28.9k|        return res;
  123|  28.9k|      }
  124|   104k|    }
  125|       |
  126|  75.6k|    void* ptr;
  127|  75.6k|    if (ABSL_PREDICT_TRUE(MaybeAllocateAligned(n, &ptr))) {
  ------------------
  |  |  191|  75.6k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 48.2k, False: 27.4k]
  |  |  |  Branch (191:48): [Folded, False: 75.6k]
  |  |  |  Branch (191:57): [True: 48.2k, False: 27.4k]
  |  |  ------------------
  ------------------
  128|  48.2k|      return ptr;
  129|  48.2k|    }
  130|  27.4k|    return AllocateAlignedFallback(n);
  131|  75.6k|  }
_ZN6google8protobuf8internal11SerialArena15AllocateAlignedILNS1_16AllocationClientE0EEEPvm:
  116|   150M|  void* AllocateAligned(size_t n) {
  117|   150M|    ABSL_DCHECK(internal::ArenaAlignDefault::IsAligned(n));
  ------------------
  |  |   47|   150M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   150M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   301M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   150M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   301M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   301M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 150M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   150M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 150M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   150M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 150M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   301M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   301M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  118|   150M|    ABSL_DCHECK_GE(limit_, ptr());
  ------------------
  |  |   82|   150M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   150M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   150M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 150M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   150M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  119|       |
  120|   150M|    if (alloc_client == AllocationClient::kArray) {
  ------------------
  |  Branch (120:9): [Folded, False: 150M]
  ------------------
  121|      0|      if (void* res = TryAllocateFromCachedBlock(n)) {
  ------------------
  |  Branch (121:17): [True: 0, False: 0]
  ------------------
  122|      0|        return res;
  123|      0|      }
  124|      0|    }
  125|       |
  126|   150M|    void* ptr;
  127|   150M|    if (ABSL_PREDICT_TRUE(MaybeAllocateAligned(n, &ptr))) {
  ------------------
  |  |  191|   150M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 150M, False: 487k]
  |  |  |  Branch (191:48): [Folded, False: 150M]
  |  |  |  Branch (191:57): [True: 150M, False: 487k]
  |  |  ------------------
  ------------------
  128|   150M|      return ptr;
  129|   150M|    }
  130|   487k|    return AllocateAlignedFallback(n);
  131|   150M|  }

_ZNK6google8protobuf8internal11StringBlock14allocated_sizeEv:
   74|   544k|  size_t allocated_size() const { return allocated_size_; }
_ZN6google8protobuf8internal11StringBlockC2EPS2_btt:
   94|   761k|      : next_(next),
   95|   761k|        allocated_size_(size),
   96|   761k|        next_size_(next_size),
   97|   761k|        heap_allocated_(heap_allocated) {}
_ZN6google8protobuf8internal11StringBlock8min_sizeEv:
   99|   552k|  static constexpr size_type min_size() { return size_type{256}; }
_ZN6google8protobuf8internal11StringBlock8max_sizeEv:
  100|   753k|  static constexpr size_type max_size() { return size_type{8192}; }
_ZNK6google8protobuf8internal11StringBlock9next_sizeEv:
  107|   753k|  size_t next_size() const { return next_size_; }
_ZN6google8protobuf8internal11StringBlock11RoundedSizeEt:
  115|   761k|constexpr StringBlock::size_type StringBlock::RoundedSize(size_type size) {
  116|   761k|  return size - (size - sizeof(StringBlock)) % sizeof(std::string);
  117|   761k|}
_ZN6google8protobuf8internal11StringBlock8NextSizeEPS2_:
  119|   761k|inline size_t StringBlock::NextSize(StringBlock* block) {
  120|   761k|  return block ? block->next_size() : min_size();
  ------------------
  |  Branch (120:10): [True: 753k, False: 8.54k]
  ------------------
  121|   761k|}
_ZN6google8protobuf8internal11StringBlock7EmplaceEPvmPS2_:
  123|   489k|inline StringBlock* StringBlock::Emplace(void* p, size_t n, StringBlock* next) {
  124|   489k|  const auto count = static_cast<size_type>(n);
  125|   489k|  ABSL_DCHECK_EQ(count, NextSize(next));
  ------------------
  |  |   74|   489k|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   489k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   489k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 489k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   489k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  126|   489k|  size_type doubled = count * 2;
  127|   489k|  size_type next_size = next ? std::min(doubled, max_size()) : min_size();
  ------------------
  |  Branch (127:25): [True: 489k, False: 0]
  ------------------
  128|   489k|  return new (p) StringBlock(next, false, RoundedSize(count), next_size);
  129|   489k|}
_ZN6google8protobuf8internal11StringBlock3NewEPS2_:
  131|   272k|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|   272k|  size_type size = min_size();
  136|   272k|  size_type next_size = min_size();
  137|   272k|  if (next) {
  ------------------
  |  Branch (137:7): [True: 263k, False: 8.54k]
  ------------------
  138|   263k|    size = next->next_size_;
  139|   263k|    next_size = std::min<size_type>(size * 2, max_size());
  140|   263k|  }
  141|   272k|  size = RoundedSize(size);
  142|   272k|  void* p = Allocate(size);
  143|   272k|  return new (p) StringBlock(next, true, size, next_size);
  144|   272k|}
_ZN6google8protobuf8internal11StringBlock6DeleteEPS2_:
  146|   761k|inline size_t StringBlock::Delete(StringBlock* block) {
  147|   761k|  ABSL_DCHECK(block != nullptr);
  ------------------
  |  |   47|   761k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   761k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.52M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   761k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.52M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.52M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 761k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   761k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 761k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   761k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 761k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.52M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.52M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  148|   761k|  if (!block->heap_allocated_) return size_t{0};
  ------------------
  |  Branch (148:7): [True: 489k, False: 272k]
  ------------------
  149|   272k|  size_t size = block->allocated_size();
  150|   272k|  internal::SizedDelete(block, size);
  151|   272k|  return size;
  152|   761k|}
_ZNK6google8protobuf8internal11StringBlock4nextEv:
  154|   761k|inline StringBlock* StringBlock::next() const { return next_; }
_ZNK6google8protobuf8internal11StringBlock14effective_sizeEv:
  156|  2.27M|inline size_t StringBlock::effective_size() const {
  157|  2.27M|  return allocated_size_ - sizeof(StringBlock);
  158|  2.27M|}
_ZN6google8protobuf8internal11StringBlock8AtOffsetEm:
  161|   247M|    size_t offset) {
  162|   247M|  ABSL_DCHECK_LE(offset, effective_size());
  ------------------
  |  |   78|   247M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|   247M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   247M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 247M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   247M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  163|   247M|  return reinterpret_cast<std::string*>(reinterpret_cast<char*>(this + 1) +
  164|   247M|                                        offset);
  165|   247M|}
_ZN6google8protobuf8internal11StringBlock5beginEv:
  167|   753k|ABSL_ATTRIBUTE_RETURNS_NONNULL inline std::string* StringBlock::begin() {
  168|   753k|  return AtOffset(0);
  169|   753k|}
_ZN6google8protobuf8internal11StringBlock3endEv:
  171|   761k|ABSL_ATTRIBUTE_RETURNS_NONNULL inline std::string* StringBlock::end() {
  172|   761k|  return AtOffset(effective_size());
  173|   761k|}

_ZN6google8protobuf8internal15ThreadSafeArena17ReturnArrayMemoryEPvm:
   82|  89.2k|  void ReturnArrayMemory(void* p, size_t size) {
   83|  89.2k|    SerialArena* arena = nullptr;
   84|  89.2k|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|  89.2k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 89.2k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 89.2k]
  |  |  |  Branch (191:57): [True: 89.2k, False: 0]
  |  |  ------------------
  ------------------
   85|  89.2k|      arena->ReturnArrayMemory(p, size);
   86|  89.2k|    }
   87|  89.2k|  }
_ZNK6google8protobuf8internal15ThreadSafeArena11AllocPolicyEv:
  167|   514k|  const AllocationPolicy* AllocPolicy() const { return alloc_policy_.get(); }
_ZN6google8protobuf8internal15ThreadSafeArena16CacheSerialArenaEPNS1_11SerialArenaE:
  177|  8.54k|  inline void CacheSerialArena(SerialArena* serial) {
  178|  8.54k|    thread_cache().last_serial_arena = serial;
  179|  8.54k|    thread_cache().last_lifecycle_id_seen = tag_and_id_;
  180|  8.54k|  }
_ZN6google8protobuf8internal15ThreadSafeArena18GetSerialArenaFastEPPNS1_11SerialArenaE:
  182|   396M|  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|   396M|    ThreadCache* tc = &thread_cache();
  187|   396M|    if (ABSL_PREDICT_TRUE(tc->last_lifecycle_id_seen == tag_and_id_)) {
  ------------------
  |  |  191|   396M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 396M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 396M]
  |  |  |  Branch (191:57): [True: 396M, False: 0]
  |  |  ------------------
  ------------------
  188|   396M|      *arena = tc->last_serial_arena;
  189|   396M|      return true;
  190|   396M|    }
  191|      0|    return false;
  192|   396M|  }
_ZN6google8protobuf8internal15ThreadSafeArena14GetSerialArenaEv:
  199|   245M|  SerialArena* GetSerialArena() {
  200|   245M|    SerialArena* arena;
  201|   245M|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|   245M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 245M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 245M]
  |  |  |  Branch (191:57): [True: 245M, False: 0]
  |  |  ------------------
  ------------------
  202|   245M|      return arena;
  203|   245M|    }
  204|      0|    return GetSerialArenaSlow();
  205|   245M|  }
_ZN6google8protobuf8internal15ThreadSafeArena12thread_cacheEv:
  273|   397M|  static ThreadCache& thread_cache() { return thread_cache_; }
_ZN6google8protobuf8internal15ThreadSafeArena15AllocateAlignedILNS1_16AllocationClientE0EEEPvm:
   73|   150M|  void* AllocateAligned(size_t n) {
   74|   150M|    SerialArena* arena;
   75|   150M|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|   150M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 150M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 150M]
  |  |  |  Branch (191:57): [True: 150M, False: 0]
  |  |  ------------------
  ------------------
   76|   150M|      return arena->AllocateAligned<alloc_client>(n);
   77|   150M|    } else {
   78|      0|      return AllocateAlignedFallback<alloc_client>(n);
   79|      0|    }
   80|   150M|  }
_ZN6google8protobuf8internal15ThreadSafeArena15AllocateAlignedILNS1_16AllocationClientE1EEEPvm:
   73|   104k|  void* AllocateAligned(size_t n) {
   74|   104k|    SerialArena* arena;
   75|   104k|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|   104k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 104k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 104k]
  |  |  |  Branch (191:57): [True: 104k, False: 0]
  |  |  ------------------
  ------------------
   76|   104k|      return arena->AllocateAligned<alloc_client>(n);
   77|   104k|    } else {
   78|      0|      return AllocateAlignedFallback<alloc_client>(n);
   79|      0|    }
   80|   104k|  }

_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|  13.5M|inline bool Status::ok() const {
 1011|  13.5M|  return rep_ == CodeToInlinedRep(absl::StatusCode::kOk);
 1012|  13.5M|}
_ZN4absl12lts_202608176Status16CodeToInlinedRepENS0_10StatusCodeE:
 1093|  40.4M|constexpr uintptr_t Status::CodeToInlinedRep(absl::StatusCode code) {
 1094|  40.4M|  return (static_cast<uintptr_t>(code) << 2) + 1;
 1095|  40.4M|}
_ZN4absl12lts_202608176StatusD2Ev:
 1008|  13.6M|inline Status::~Status() { Unref(rep_); }
_ZN4absl12lts_202608176Status5UnrefEm:
 1121|  13.6M|inline void Status::Unref(uintptr_t rep) {
 1122|  13.6M|  if (!IsInlined(rep)) RepToPointer(rep)->Unref();
  ------------------
  |  Branch (1122:7): [True: 0, False: 13.6M]
  ------------------
 1123|  13.6M|}
_ZN4absl12lts_202608176Status9IsInlinedEm:
 1089|  13.8M|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.37k|    -> decltype(GetDataImpl(c, 0)) {
   51|  1.37k|  return GetDataImpl(c, 0);
   52|  1.37k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorINS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS8_ISA_EEEEEEDTcldtfp_4dataEERT_c:
   38|  1.37k|    -> decltype(c.data()) {
   39|  1.37k|  return c.data();
   40|  1.37k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__16vectorIiNS3_9allocatorIiEEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  1.40k|    -> decltype(GetDataImpl(c, 0)) {
   51|  1.40k|  return GetDataImpl(c, 0);
   52|  1.40k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorIiNS3_9allocatorIiEEEEEEDTcldtfp_4dataEERT_c:
   38|  1.40k|    -> decltype(c.data()) {
   39|  1.40k|  return c.data();
   40|  1.40k|}

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

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

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

_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|  74.7M|inline const ::sentencepiece::TrainerSpec& ModelProto::trainer_spec() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 5008|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.trainer_spec)
 5009|  74.7M|  return _internal_trainer_spec();
 5010|  74.7M|}
_ZNK13sentencepiece10ModelProto22_internal_trainer_specEv:
 5002|  74.7M|inline const ::sentencepiece::TrainerSpec& ModelProto::_internal_trainer_spec() const {
 5003|  74.7M|  ::google::protobuf::internal::TSanRead(&_impl_);
 5004|  74.7M|  const ::sentencepiece::TrainerSpec* p = _impl_.trainer_spec_;
 5005|  74.7M|  return p != nullptr ? *p : *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<::sentencepiece::TrainerSpec>(&::sentencepiece::TrainerSpec_globals_);
  ------------------
  |  Branch (5005:10): [True: 74.7M, False: 0]
  ------------------
 5006|  74.7M|}
_ZNK13sentencepiece11TrainerSpec13byte_fallbackEv:
 3611|  74.7M|inline bool TrainerSpec::byte_fallback() const {
 3612|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.byte_fallback)
 3613|  74.7M|  return _internal_byte_fallback();
 3614|  74.7M|}
_ZNK13sentencepiece11TrainerSpec23_internal_byte_fallbackEv:
 3620|  74.7M|inline bool TrainerSpec::_internal_byte_fallback() const {
 3621|  74.7M|  ::google::protobuf::internal::TSanRead(&_impl_);
 3622|  74.7M|  return _impl_.byte_fallback_;
 3623|  74.7M|}
_ZNK13sentencepiece10ModelProto11pieces_sizeEv:
 4940|  17.4M|inline int ModelProto::pieces_size() const {
 4941|  17.4M|  return _internal_pieces_size();
 4942|  17.4M|}
_ZNK13sentencepiece10ModelProto21_internal_pieces_sizeEv:
 4937|  17.4M|inline int ModelProto::_internal_pieces_size() const {
 4938|  17.4M|  return _internal_pieces().size();
 4939|  17.4M|}
_ZNK13sentencepiece10ModelProto16_internal_piecesEv:
 4981|   450M|ModelProto::_internal_pieces() const {
 4982|   450M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4983|   450M|  return _impl_.pieces_;
 4984|   450M|}
_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|  32.7M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4817|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.piece)
 4818|  32.7M|  return _internal_piece();
 4819|  32.7M|}
_ZNK13sentencepiece24ModelProto_SentencePiece15_internal_pieceEv:
 4834|  32.7M|inline const ::std::string& ModelProto_SentencePiece::_internal_piece() const {
 4835|  32.7M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4836|  32.7M|  return _impl_.piece_.Get();
 4837|  32.7M|}
_ZNK13sentencepiece10ModelProto15normalizer_specEv:
 5105|  8.51k|inline const ::sentencepiece::NormalizerSpec& ModelProto::normalizer_spec() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 5106|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.normalizer_spec)
 5107|  8.51k|  return _internal_normalizer_spec();
 5108|  8.51k|}
_ZNK13sentencepiece10ModelProto25_internal_normalizer_specEv:
 5100|  8.51k|inline const ::sentencepiece::NormalizerSpec& ModelProto::_internal_normalizer_spec() const {
 5101|  8.51k|  ::google::protobuf::internal::TSanRead(&_impl_);
 5102|  8.51k|  const ::sentencepiece::NormalizerSpec* p = _impl_.normalizer_spec_;
 5103|  8.51k|  return p != nullptr ? *p : *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<::sentencepiece::NormalizerSpec>(&::sentencepiece::NormalizerSpec_globals_);
  ------------------
  |  Branch (5103:10): [True: 8.51k, False: 0]
  ------------------
 5104|  8.51k|}
_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|  2.77k|inline bool TrainerSpec::has_unk_surface() const {
 4083|  2.77k|  bool value = CheckHasBit(_impl_._has_bits_[0], 0x00000040U);
 4084|  2.77k|  return value;
 4085|  2.77k|}
_ZNK13sentencepiece14NormalizerSpec16add_dummy_prefixEv:
 4659|  19.7k|inline bool NormalizerSpec::add_dummy_prefix() const {
 4660|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.add_dummy_prefix)
 4661|  19.7k|  return _internal_add_dummy_prefix();
 4662|  19.7k|}
_ZNK13sentencepiece14NormalizerSpec26_internal_add_dummy_prefixEv:
 4668|  19.7k|inline bool NormalizerSpec::_internal_add_dummy_prefix() const {
 4669|  19.7k|  ::google::protobuf::internal::TSanRead(&_impl_);
 4670|  19.7k|  return _impl_.add_dummy_prefix_;
 4671|  19.7k|}
_ZNK13sentencepiece14NormalizerSpec24remove_extra_whitespacesEv:
 4687|   189M|inline bool NormalizerSpec::remove_extra_whitespaces() const {
 4688|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.remove_extra_whitespaces)
 4689|   189M|  return _internal_remove_extra_whitespaces();
 4690|   189M|}
_ZNK13sentencepiece14NormalizerSpec34_internal_remove_extra_whitespacesEv:
 4696|   189M|inline bool NormalizerSpec::_internal_remove_extra_whitespaces() const {
 4697|   189M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4698|   189M|  return _impl_.remove_extra_whitespaces_;
 4699|   189M|}
_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|  15.5k|inline bool NormalizerSpec::escape_whitespaces() const {
 4716|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.escape_whitespaces)
 4717|  15.5k|  return _internal_escape_whitespaces();
 4718|  15.5k|}
_ZNK13sentencepiece14NormalizerSpec28_internal_escape_whitespacesEv:
 4724|  15.5k|inline bool NormalizerSpec::_internal_escape_whitespaces() const {
 4725|  15.5k|  ::google::protobuf::internal::TSanRead(&_impl_);
 4726|  15.5k|  return _impl_.escape_whitespaces_;
 4727|  15.5k|}
_ZNK13sentencepiece24ModelProto_SentencePiece5scoreEv:
 4883|  34.1M|inline float ModelProto_SentencePiece::score() const {
 4884|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.score)
 4885|  34.1M|  return _internal_score();
 4886|  34.1M|}
_ZNK13sentencepiece24ModelProto_SentencePiece15_internal_scoreEv:
 4892|  34.1M|inline float ModelProto_SentencePiece::_internal_score() const {
 4893|  34.1M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4894|  34.1M|  return _impl_.score_;
 4895|  34.1M|}
_ZNK13sentencepiece24ModelProto_SentencePiece4typeEv:
 4911|   365M|inline ::sentencepiece::ModelProto_SentencePiece_Type ModelProto_SentencePiece::type() const {
 4912|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.type)
 4913|   365M|  return _internal_type();
 4914|   365M|}
_ZNK13sentencepiece24ModelProto_SentencePiece14_internal_typeEv:
 4920|   365M|inline ::sentencepiece::ModelProto_SentencePiece_Type ModelProto_SentencePiece::_internal_type() const {
 4921|   365M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4922|   365M|  return static_cast<::sentencepiece::ModelProto_SentencePiece_Type>(_impl_.type_);
 4923|   365M|}
_ZNK13sentencepiece10ModelProto6piecesEi:
 4949|   432M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4950|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.pieces)
 4951|   432M|  return _internal_pieces().Get(index);
 4952|   432M|}
_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|  8.41k|  virtual ~FreeList() = default;
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEEaSEOS5_:
   44|  7.49k|  FreeList& operator=(FreeList&& other) noexcept = default;
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEED2Ev:
   39|  12.1k|  virtual ~FreeList() = default;
_ZN13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEEC2Em:
   38|  8.41k|  explicit FreeList(size_t chunk_size) : chunk_size_(chunk_size) {}
_ZN13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEE8AllocateEv:
   59|  69.2M|  T* Allocate() {
   60|  69.2M|    if (element_index_ >= chunk_size_) {
  ------------------
  |  Branch (60:9): [True: 65.6k, False: 69.1M]
  ------------------
   61|  65.6k|      ++chunk_index_;
   62|  65.6k|      element_index_ = 0;
   63|  65.6k|    }
   64|       |
   65|  69.2M|    if (chunk_index_ == freelist_.size()) {
  ------------------
  |  Branch (65:9): [True: 74.0k, False: 69.1M]
  ------------------
   66|  74.0k|      auto chunk = std::make_unique<T[]>(chunk_size_);
   67|  74.0k|      std::memset(static_cast<void*>(chunk.get()), 0, sizeof(T) * chunk_size_);
   68|  74.0k|      freelist_.push_back(std::move(chunk));
   69|  74.0k|    }
   70|       |
   71|  69.2M|    T* result = freelist_[chunk_index_].get() + element_index_;
   72|  69.2M|    ++element_index_;
   73|       |
   74|  69.2M|    return result;
   75|  69.2M|  }
_ZNK13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEE4sizeEv:
   56|  69.2M|  size_t size() const { return chunk_size_ * chunk_index_ + element_index_; }
_ZN13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEE4FreeEv:
   47|  8.41k|  void Free() {
   48|  8.41k|    for (auto& chunk : freelist_) {
  ------------------
  |  Branch (48:22): [True: 0, False: 8.41k]
  ------------------
   49|      0|      std::memset(static_cast<void*>(chunk.get()), 0, sizeof(T) * chunk_size_);
   50|      0|    }
   51|  8.41k|    chunk_index_ = 0;
   52|  8.41k|    element_index_ = 0;
   53|  8.41k|  }
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEE8AllocateEv:
   59|   608M|  T* Allocate() {
   60|   608M|    if (element_index_ >= chunk_size_) {
  ------------------
  |  Branch (60:9): [True: 1.18M, False: 607M]
  ------------------
   61|  1.18M|      ++chunk_index_;
   62|  1.18M|      element_index_ = 0;
   63|  1.18M|    }
   64|       |
   65|   608M|    if (chunk_index_ == freelist_.size()) {
  ------------------
  |  Branch (65:9): [True: 1.19M, False: 607M]
  ------------------
   66|  1.19M|      auto chunk = std::make_unique<T[]>(chunk_size_);
   67|  1.19M|      std::memset(static_cast<void*>(chunk.get()), 0, sizeof(T) * chunk_size_);
   68|  1.19M|      freelist_.push_back(std::move(chunk));
   69|  1.19M|    }
   70|       |
   71|   608M|    T* result = freelist_[chunk_index_].get() + element_index_;
   72|   608M|    ++element_index_;
   73|       |
   74|   608M|    return result;
   75|   608M|  }
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEEC2Em:
   38|  12.1k|  explicit FreeList(size_t chunk_size) : chunk_size_(chunk_size) {}
unigram_model.cc:_ZNK13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEE4sizeEv:
   56|   329M|  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|   210M|const std::string& ByteToPiece(unsigned char c) {
  257|   210M|  static const absl::NoDestructor<std::vector<std::string>> kBytePieces([] {
  258|   210M|    std::vector<std::string> v(256);
  259|   210M|    for (int i = 0; i < 256; ++i) {
  260|   210M|      v[i] = absl::StrFormat("<0x%02X>", i);
  261|   210M|    }
  262|   210M|    return v;
  263|   210M|  }());
  264|   210M|  return (*kBytePieces)[c];
  265|   210M|}
_ZN13sentencepiece11PieceToByteENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE:
  267|  63.7M|int PieceToByte(absl::string_view piece) {
  268|  63.7M|  using PieceToByteMap = absl::flat_hash_map<absl::string_view, unsigned char>;
  269|  63.7M|  static const absl::NoDestructor<PieceToByteMap> kMap([] {
  270|  63.7M|    PieceToByteMap m;
  271|  63.7M|    for (int i = 0; i < 256; ++i) {
  272|  63.7M|      m[ByteToPiece(i)] = i;
  273|  63.7M|    }
  274|  63.7M|    return m;
  275|  63.7M|  }());
  276|       |
  277|  63.7M|  if (const auto it = kMap->find(piece); it != kMap->end()) {
  ------------------
  |  Branch (277:42): [True: 63.7M, False: 0]
  ------------------
  278|  63.7M|    return it->second;
  279|  63.7M|  }
  280|       |
  281|      0|  return -1;
  282|  63.7M|}
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|   121k|  virtual absl::Status status() const { return status_; }
_ZNK13sentencepiece14ModelInterface14prefix_matcherEv:
   78|      2|      const {
   79|      2|    return matcher_.get();
   80|      2|  }
_ZNK13sentencepiece14ModelInterface9IdToPieceEi:
  119|  32.7M|  [[nodiscard]] virtual const std::string& IdToPiece(int id) const {
  120|  32.7M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  32.7M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  32.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  32.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 32.7M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  32.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  121|  32.7M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  32.7M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  32.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  32.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 32.7M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  32.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  122|  32.7M|    return model_proto_->pieces(id).piece();
  123|  32.7M|  }
_ZNK13sentencepiece14ModelInterface12GetPieceSizeEv:
  127|  17.4M|  [[nodiscard]] virtual int GetPieceSize() const {
  128|  17.4M|    if (model_proto_ == nullptr) {
  ------------------
  |  Branch (128:9): [True: 0, False: 17.4M]
  ------------------
  129|      0|      return 0;
  130|      0|    }
  131|  17.4M|    return model_proto_->pieces_size();
  132|  17.4M|  }
_ZNK13sentencepiece14ModelInterface8GetScoreEi:
  137|  10.3k|  [[nodiscard]] virtual float GetScore(int id) const {
  138|  10.3k|    return GetScoreInlined(id);
  139|  10.3k|  }
_ZNK13sentencepiece14ModelInterface9IsUnknownEi:
  142|  49.3M|  [[nodiscard]] virtual bool IsUnknown(int id) const {
  143|  49.3M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  49.3M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  49.3M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  49.3M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 49.3M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  49.3M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  144|  49.3M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  49.3M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  49.3M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  49.3M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 49.3M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  49.3M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  145|  49.3M|    return (model_proto_->pieces(id).type() ==
  146|  49.3M|            ModelProto::SentencePiece::UNKNOWN);
  147|  49.3M|  }
_ZNK13sentencepiece14ModelInterface9IsControlEi:
  150|   171M|  [[nodiscard]] virtual bool IsControl(int id) const {
  151|   171M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|   171M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   171M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   171M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 171M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   171M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  152|   171M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|   171M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|   171M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   171M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 171M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   171M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  153|   171M|    return (model_proto_->pieces(id).type() ==
  154|   171M|            ModelProto::SentencePiece::CONTROL);
  155|   171M|  }
_ZNK13sentencepiece14ModelInterface8IsUnusedEi:
  158|  10.3k|  [[nodiscard]] virtual bool IsUnused(int id) const {
  159|  10.3k|    return IsUnusedInlined(id);
  160|  10.3k|  }
_ZNK13sentencepiece14ModelInterface6IsByteEi:
  168|  76.9M|  [[nodiscard]] virtual bool IsByte(int id) const {
  169|  76.9M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  76.9M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  76.9M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  76.9M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 76.9M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  76.9M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  170|  76.9M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  76.9M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  76.9M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  76.9M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 76.9M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  76.9M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  171|  76.9M|    return (model_proto_->pieces(id).type() == ModelProto::SentencePiece::BYTE);
  172|  76.9M|  }
_ZNK13sentencepiece14ModelInterface19ByteFallbackEnabledEv:
  174|  74.7M|  [[nodiscard]] virtual bool ByteFallbackEnabled() const {
  175|  74.7M|    return (model_proto_ != nullptr) &&
  ------------------
  |  Branch (175:12): [True: 74.7M, False: 0]
  ------------------
  176|  74.7M|           model_proto_->trainer_spec().byte_fallback();
  ------------------
  |  Branch (176:12): [True: 74.7M, False: 0]
  ------------------
  177|  74.7M|  }
_ZNK13sentencepiece14ModelInterface15GetScoreInlinedEi:
  188|  34.1M|  [[nodiscard]] float GetScoreInlined(int id) const {
  189|  34.1M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  34.1M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 34.1M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  34.1M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  190|  34.1M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  34.1M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 34.1M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  34.1M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  191|  34.1M|    return model_proto_->pieces(id).score();
  192|  34.1M|  }
_ZNK13sentencepiece14ModelInterface15IsUnusedInlinedEi:
  194|  34.1M|  [[nodiscard]] bool IsUnusedInlined(int id) const {
  195|  34.1M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  34.1M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 34.1M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  34.1M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  196|  34.1M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  34.1M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 34.1M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  34.1M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  197|  34.1M|    return (model_proto_->pieces(id).type() ==
  198|  34.1M|            ModelProto::SentencePiece::UNUSED);
  199|  34.1M|  }
_ZNK13sentencepiece14ModelInterface20IsUserDefinedInlinedEi:
  201|  34.1M|  [[nodiscard]] bool IsUserDefinedInlined(int id) const {
  202|  34.1M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  34.1M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 34.1M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  34.1M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  203|  34.1M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  34.1M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  34.1M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 34.1M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  34.1M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  204|  34.1M|    return (model_proto_->pieces(id).type() ==
  205|  34.1M|            ModelProto::SentencePiece::USER_DEFINED);
  206|  34.1M|  }
_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|  15.6k|                                   std::vector<size_t>* norm_to_orig) const {
   91|  15.6k|  if (norm_to_orig) norm_to_orig->clear();
  ------------------
  |  Branch (91:7): [True: 10.0k, False: 5.64k]
  ------------------
   92|  15.6k|  normalized->clear();
   93|       |
   94|  15.6k|  if (input.empty()) {
  ------------------
  |  Branch (94:7): [True: 0, False: 15.6k]
  ------------------
   95|      0|    return absl::OkStatus();
   96|      0|  }
   97|       |
   98|  15.6k|  ABSL_RETURN_IF_ERROR(status());
  ------------------
  |  |   90|  15.6k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  46.9k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  31.3k|  switch (0)                                           \
  |  |  |  |  |  |  350|  31.3k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 15.6k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  15.6k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 15.6k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  46.9k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 15.6k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  46.9k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  46.9k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  15.6k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  46.9k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
   99|       |
  100|  15.6k|  size_t consumed = 0;
  101|       |
  102|       |  // Ignores heading space.
  103|  15.6k|  if (spec_->remove_extra_whitespaces()) {
  ------------------
  |  Branch (103:7): [True: 15.6k, False: 0]
  ------------------
  104|  9.45M|    while (!input.empty()) {
  ------------------
  |  Branch (104:12): [True: 9.45M, False: 140]
  ------------------
  105|  9.45M|      const auto p = NormalizePrefix(input);
  106|  9.45M|      if (p.first != " ") {
  ------------------
  |  Branch (106:11): [True: 15.5k, False: 9.43M]
  ------------------
  107|  15.5k|        break;
  108|  15.5k|      }
  109|  9.43M|      input.remove_prefix(p.second);
  110|  9.43M|      consumed += p.second;
  111|  9.43M|    }
  112|  15.6k|  }
  113|       |
  114|       |  // all chars are whitespace.
  115|  15.6k|  if (input.empty()) {
  ------------------
  |  Branch (115:7): [True: 140, False: 15.5k]
  ------------------
  116|    140|    return absl::OkStatus();
  117|    140|  }
  118|       |
  119|       |  // Reserves the output buffer to avoid re-allocations.
  120|  15.5k|  const size_t kReservedSize = input.size() * 1.5;
  121|  15.5k|  normalized->reserve(kReservedSize);
  122|  15.5k|  if (norm_to_orig) norm_to_orig->reserve(kReservedSize);
  ------------------
  |  Branch (122:7): [True: 9.93k, False: 5.59k]
  ------------------
  123|       |
  124|       |  // Replaces white space with U+2581 (LOWER ONE EIGHT BLOCK)
  125|       |  // if escape_whitespaces() is set (default = true).
  126|  15.5k|  const absl::string_view kSpaceSymbol =
  127|  15.5k|      spec_->escape_whitespaces() ? "\xe2\x96\x81" : " ";
  ------------------
  |  Branch (127:7): [True: 15.5k, False: 0]
  ------------------
  128|       |
  129|       |  // adds kSpaceSymbol to the current context.
  130|  15.5k|  auto add_ws = [&consumed, &normalized, &norm_to_orig, &kSpaceSymbol]() {
  131|  15.5k|    normalized->append(kSpaceSymbol.data(), kSpaceSymbol.size());
  132|  15.5k|    if (norm_to_orig) {
  133|  15.5k|      norm_to_orig->insert(norm_to_orig->end(), kSpaceSymbol.size(), consumed);
  134|  15.5k|    }
  135|  15.5k|  };
  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|  15.5k|  if (!treat_whitespace_as_suffix_ && spec_->add_dummy_prefix()) add_ws();
  ------------------
  |  Branch (141:7): [True: 15.5k, False: 0]
  |  Branch (141:39): [True: 15.5k, False: 0]
  ------------------
  142|       |
  143|  15.5k|  bool is_prev_space = spec_->remove_extra_whitespaces();
  144|   189M|  while (!input.empty()) {
  ------------------
  |  Branch (144:10): [True: 189M, False: 15.5k]
  ------------------
  145|   189M|    auto p = NormalizePrefix(input);
  146|   189M|    absl::string_view sp = p.first;
  147|       |
  148|       |    // Removes heading spaces in sentence piece,
  149|       |    // if the previous sentence piece ends with whitespace.
  150|   190M|    while (is_prev_space && absl::ConsumePrefix(&sp, " ")) {
  ------------------
  |  Branch (150:12): [True: 7.89M, False: 182M]
  |  Branch (150:29): [True: 827k, False: 7.06M]
  ------------------
  151|   827k|    }
  152|       |
  153|   189M|    if (!sp.empty()) {
  ------------------
  |  Branch (153:9): [True: 188M, False: 827k]
  ------------------
  154|   188M|      const char* data = sp.data();
  155|   471M|      for (size_t n = 0; n < sp.size(); ++n) {
  ------------------
  |  Branch (155:26): [True: 282M, False: 188M]
  ------------------
  156|   282M|        if (data[n] == ' ') {
  ------------------
  |  Branch (156:13): [True: 6.22M, False: 276M]
  ------------------
  157|  6.22M|          add_ws();
  158|   276M|        } else {
  159|   276M|          *normalized += data[n];
  160|   276M|          if (norm_to_orig) norm_to_orig->push_back(consumed);
  ------------------
  |  Branch (160:15): [True: 140M, False: 135M]
  ------------------
  161|   276M|        }
  162|   282M|      }
  163|       |      // Checks whether the last character of sp is whitespace.
  164|   188M|      is_prev_space = absl::EndsWith(sp, " ");
  165|   188M|    }
  166|       |
  167|   189M|    consumed += p.second;
  168|   189M|    input.remove_prefix(p.second);
  169|   189M|    if (!spec_->remove_extra_whitespaces()) {
  ------------------
  |  Branch (169:9): [True: 0, False: 189M]
  ------------------
  170|      0|      is_prev_space = false;
  171|      0|    }
  172|   189M|  }
  173|       |
  174|       |  // Ignores trailing space.
  175|  15.5k|  if (spec_->remove_extra_whitespaces()) {
  ------------------
  |  Branch (175:7): [True: 15.5k, False: 0]
  ------------------
  176|  17.4k|    while (absl::EndsWith(*normalized, kSpaceSymbol)) {
  ------------------
  |  Branch (176:12): [True: 1.92k, False: 15.5k]
  ------------------
  177|  1.92k|      const int length = normalized->size() - kSpaceSymbol.size();
  178|  1.92k|      RET_CHECK_GE(length, 0);
  ------------------
  |  |   30|  1.92k|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  1.92k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.92k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.92k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.92k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  179|  1.92k|      normalized->resize(length);
  180|  1.92k|      if (norm_to_orig) {
  ------------------
  |  Branch (180:11): [True: 1.16k, False: 766]
  ------------------
  181|  1.16k|        consumed = (*norm_to_orig)[length];
  182|  1.16k|        norm_to_orig->resize(length);
  183|  1.16k|      }
  184|  1.92k|    }
  185|  15.5k|  }
  186|       |
  187|       |  // Adds a space symbol as a suffix (default is false)
  188|  15.5k|  if (treat_whitespace_as_suffix_ && spec_->add_dummy_prefix()) add_ws();
  ------------------
  |  Branch (188:7): [True: 0, False: 15.5k]
  |  Branch (188:38): [True: 0, False: 0]
  ------------------
  189|       |
  190|  15.5k|  if (norm_to_orig) {
  ------------------
  |  Branch (190:7): [True: 9.93k, False: 5.59k]
  ------------------
  191|  9.93k|    norm_to_orig->push_back(consumed);
  192|  9.93k|    RET_CHECK_EQ(norm_to_orig->size(), normalized->size() + 1);
  ------------------
  |  |   28|  9.93k|#define RET_CHECK_EQ(a, b) RET_CHECK((a) == (b))
  |  |  ------------------
  |  |  |  |   23|  9.93k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 9.93k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  9.93k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  9.93k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  193|  9.93k|  }
  194|       |
  195|  15.5k|  return absl::OkStatus();
  196|  15.5k|}
_ZNK13sentencepiece10normalizer10Normalizer15NormalizePrefixENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  205|   199M|    absl::string_view input) const {
  206|   199M|  if (input.empty()) return {};
  ------------------
  |  Branch (206:7): [True: 0, False: 199M]
  ------------------
  207|       |
  208|   199M|  if (matcher_ != nullptr) {
  ------------------
  |  Branch (208:7): [True: 199M, False: 0]
  ------------------
  209|   199M|    bool found = false;
  210|   199M|    const int mblen = matcher_->PrefixMatch(input, &found);
  211|   199M|    if (found) return {input.substr(0, mblen), mblen};
  ------------------
  |  Branch (211:9): [True: 0, False: 199M]
  ------------------
  212|   199M|  }
  213|       |
  214|   199M|  size_t longest_length = 0;
  215|   199M|  size_t longest_value = 0;
  216|       |
  217|   199M|  if (trie_ != nullptr) {
  ------------------
  |  Branch (217:7): [True: 0, False: 199M]
  ------------------
  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|   199M|  std::pair<absl::string_view, int> result;
  246|   199M|  if (longest_length == 0 || longest_length > input.size() ||
  ------------------
  |  Branch (246:7): [True: 199M, False: 0]
  |  Branch (246:30): [True: 0, False: 0]
  ------------------
  247|   199M|      longest_value >= normalized_.size()) {
  ------------------
  |  Branch (247:7): [True: 0, False: 0]
  ------------------
  248|   199M|    size_t length = 0;
  249|   199M|    if (!string_util::IsValidDecodeUTF8(input, &length)) {
  ------------------
  |  Branch (249:9): [True: 46.0M, False: 153M]
  ------------------
  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|  46.0M|      result.second = 1;
  255|  46.0M|      static constexpr absl::string_view kReplacementChar = "\xEF\xBF\xBD";
  256|  46.0M|      result.first = kReplacementChar;
  257|   153M|    } else {
  258|   153M|      result.second = length;
  259|   153M|      result.first = absl::string_view(input.data(), result.second);
  260|   153M|    }
  261|   199M|  } 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|   199M|  return result;
  269|   199M|}
_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|   199M|int PrefixMatcher::PrefixMatch(absl::string_view w, bool* found) const {
  358|   199M|  if (w.empty()) {
  ------------------
  |  Branch (358:7): [True: 0, False: 199M]
  ------------------
  359|      0|    if (found) *found = false;
  ------------------
  |  Branch (359:9): [True: 0, False: 0]
  ------------------
  360|      0|    return 0;
  361|      0|  }
  362|       |
  363|   199M|  if (trie_ == nullptr) {
  ------------------
  |  Branch (363:7): [True: 199M, False: 0]
  ------------------
  364|   199M|    if (found) *found = false;
  ------------------
  |  Branch (364:9): [True: 199M, False: 0]
  ------------------
  365|   199M|    return std::min<int>(w.size(), string_util::OneCharLen(w.data()));
  366|   199M|  }
  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|  6.24M|  auto add_ws = [&consumed, &normalized, &norm_to_orig, &kSpaceSymbol]() {
  131|  6.24M|    normalized->append(kSpaceSymbol.data(), kSpaceSymbol.size());
  132|  6.24M|    if (norm_to_orig) {
  ------------------
  |  Branch (132:9): [True: 3.97M, False: 2.26M]
  ------------------
  133|  3.97M|      norm_to_orig->insert(norm_to_orig->end(), kSpaceSymbol.size(), consumed);
  134|  3.97M|    }
  135|  6.24M|  };

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

_ZN13sentencepiece22SentencePieceProcessorC2Ev:
   86|      2|SentencePieceProcessor::SentencePieceProcessor() {}
_ZN13sentencepiece22SentencePieceProcessor23LoadFromSerializedProtoENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  106|      2|    absl::string_view serialized) {
  107|      2|  auto model_proto = std::make_unique<ModelProto>();
  108|      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 << "] "
  ------------------
  109|      2|  return Load(std::move(model_proto));
  110|      2|}
_ZN13sentencepiece22SentencePieceProcessor4LoadENSt3__110unique_ptrINS_10ModelProtoENS1_14default_deleteIS3_EEEE:
  113|      2|    std::unique_ptr<ModelProto> model_proto) {
  114|      2|  model_proto_ = std::move(model_proto);
  115|       |  // Workaround for https://github.com/google/sentencepiece/issues/1308
  116|       |  // Third-party conversion scripts may erroneously insert a raw null-byte
  117|       |  // piece ("\0") even when byte_fallback is enabled (where "<0x00>" is
  118|       |  // already defined). Mark it as UNUSED so it is excluded from trie building
  119|       |  // and encoding.
  120|      2|  if (model_proto_->trainer_spec().byte_fallback()) {
  ------------------
  |  Branch (120:7): [True: 2, False: 0]
  ------------------
  121|    598|    for (int i = 0; i < model_proto_->pieces_size(); ++i) {
  ------------------
  |  Branch (121:21): [True: 596, False: 2]
  ------------------
  122|    596|      auto* sp = model_proto_->mutable_pieces(i);
  123|    596|      if (sp->piece() == kNullPiece) {
  ------------------
  |  Branch (123:11): [True: 0, False: 596]
  ------------------
  124|      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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  125|      0|            << "Piece at index " << i
  126|      0|            << " is a null character (\\0) and byte_fallback is enabled. "
  127|      0|            << "Treating it as an UNUSED piece.";
  128|      0|        sp->set_type(ModelProto::SentencePiece::UNUSED);
  129|      0|      }
  130|    596|    }
  131|      2|  }
  132|      2|  model_ = ModelFactory::Create(*model_proto_);
  133|      2|  normalizer_ = std::make_unique<normalizer::Normalizer>(
  134|      2|      model_proto_->normalizer_spec(), model_proto_->trainer_spec());
  135|      2|  if (model_proto_->has_denormalizer_spec() &&
  ------------------
  |  Branch (135:7): [True: 0, False: 2]
  ------------------
  136|      0|      !model_proto_->denormalizer_spec().precompiled_charsmap().empty()) {
  ------------------
  |  Branch (136:7): [True: 0, False: 0]
  ------------------
  137|      0|    denormalizer_ = std::make_unique<normalizer::Normalizer>(
  138|      0|        model_proto_->denormalizer_spec());
  139|      0|  }
  140|       |
  141|       |  // Escapes user-defined-symbols in normalizer.
  142|      2|  normalizer_->SetPrefixMatcher(model_->prefix_matcher());
  143|       |
  144|      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()
  |  |  ------------------
  ------------------
  145|       |
  146|       |  // Precomputes and caches special token IDs.
  147|       |  // Note that these IDs are not always the same as the IDs in TrainerSpec.
  148|      2|  unk_id_ = PieceToId(model_->unk_piece());
  149|      2|  if (unk_id_ >= 0 && !IsUnknown(unk_id_)) unk_id_ = -1;
  ------------------
  |  Branch (149:7): [True: 2, False: 0]
  |  Branch (149:23): [True: 0, False: 2]
  ------------------
  150|       |
  151|      2|  bos_id_ = PieceToId(model_->bos_piece());
  152|      2|  if (bos_id_ >= 0 && !IsControl(bos_id_)) bos_id_ = -1;
  ------------------
  |  Branch (152:7): [True: 2, False: 0]
  |  Branch (152:23): [True: 0, False: 2]
  ------------------
  153|       |
  154|      2|  eos_id_ = PieceToId(model_->eos_piece());
  155|      2|  if (eos_id_ >= 0 && !IsControl(eos_id_)) eos_id_ = -1;
  ------------------
  |  Branch (155:7): [True: 2, False: 0]
  |  Branch (155:23): [True: 0, False: 2]
  ------------------
  156|       |
  157|      2|  pad_id_ = PieceToId(model_->pad_piece());
  158|      2|  if (pad_id_ >= 0 && !IsControl(pad_id_)) pad_id_ = -1;
  ------------------
  |  Branch (158:7): [True: 2, False: 0]
  |  Branch (158:23): [True: 2, False: 0]
  ------------------
  159|       |
  160|      2|  return absl::OkStatus();
  161|      2|}
_ZNK13sentencepiece22SentencePieceProcessor6statusEv:
  173|   108k|absl::Status SentencePieceProcessor::status() const {
  174|   108k|  RET_CHECK(model_) << "Model is not initialized.";
  ------------------
  |  |   23|   108k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 108k, False: 0]
  |  |  ------------------
  |  |   24|   108k|  } else /* NOLINT */                                         \
  |  |   25|   108k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  175|   108k|  RET_CHECK(normalizer_) << "Normalizer is not initialized.";
  ------------------
  |  |   23|   108k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 108k, False: 0]
  |  |  ------------------
  |  |   24|   108k|  } else /* NOLINT */                                         \
  |  |   25|   108k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  176|   108k|  ABSL_RETURN_IF_ERROR(model_->status());
  ------------------
  |  |   90|   108k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|   325k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|   217k|  switch (0)                                           \
  |  |  |  |  |  |  350|   217k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 108k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|   108k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 108k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|   325k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 108k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|   325k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|   325k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|   108k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|   325k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  177|   108k|  ABSL_RETURN_IF_ERROR(normalizer_->status());
  ------------------
  |  |   90|   108k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|   325k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|   217k|  switch (0)                                           \
  |  |  |  |  |  |  350|   217k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 108k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|   108k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 108k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|   325k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 108k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|   325k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|   325k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|   108k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|   325k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  178|   108k|  return absl::OkStatus();
  179|   108k|}
_ZNK13sentencepiece22SentencePieceProcessor6EncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_6vectorINS1_12basic_stringIcS4_NS1_9allocatorIcEEEENS8_ISA_EEEE:
  194|  2.74k|    absl::string_view input, std::vector<std::string>* pieces) const {
  195|  2.74k|  return EncodeOptimized(input, pieces);
  196|  2.74k|}
_ZNK13sentencepiece22SentencePieceProcessor6EncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_6vectorIiNS1_9allocatorIiEEEE:
  199|  1.42k|                                            std::vector<int>* ids) const {
  200|  1.42k|  return EncodeOptimized(input, ids);
  201|  1.42k|}
_ZNK13sentencepiece22SentencePieceProcessor6DecodeEN4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEPSA_:
  204|  1.37k|    absl::Span<const std::string> pieces, std::string* detokenized) const {
  205|  1.37k|  absl::FixedArray<absl::string_view, 128> views(pieces.begin(), pieces.end());
  206|  1.37k|  return DecodeOptimized<absl::string_view>(views, detokenized);
  207|  1.37k|}
_ZNK13sentencepiece22SentencePieceProcessor6DecodeEN4absl12lts_202608174SpanIKiEEPNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEE:
  216|  1.40k|                                            std::string* detokenized) const {
  217|  1.40k|  return DecodeOptimized(ids, detokenized);
  218|  1.40k|}
_ZNK13sentencepiece22SentencePieceProcessor11NBestEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEiPNS1_6vectorINS6_INS1_12basic_stringIcS4_NS1_9allocatorIcEEEENS8_ISA_EEEENS8_ISC_EEEE:
  222|  2.66k|    std::vector<std::vector<std::string>>* pieces) const {
  223|  5.33k|  RET_CHECK_STATUS_STL(pieces);
  ------------------
  |  |  182|  2.66k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  2.66k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  5.33k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  5.33k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  5.33k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 2.66k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  2.66k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 2.66k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  5.33k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 2.66k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  5.33k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  5.33k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  2.66k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  5.33k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  2.66k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  2.66k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 2.66k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  2.66k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  2.66k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  2.66k|  container->clear();
  ------------------
  224|       |
  225|  5.33k|  Arena arena;
  226|  5.33k|  auto* spt = Arena::Create<NBestSentencePieceText>(&arena);
  227|  5.33k|  ABSL_RETURN_IF_ERROR(NBestEncode(input, nbest_size, spt));
  ------------------
  |  |   90|  2.66k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  5.33k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  5.33k|  switch (0)                                           \
  |  |  |  |  |  |  350|  5.33k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 2.66k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  2.66k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 2.66k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  5.33k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 2.66k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  5.33k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  5.33k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  2.66k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  5.33k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  228|  2.66k|  pieces->reserve(spt->nbests().size());
  229|  5.27k|  for (const auto& nbest : spt->nbests()) {
  ------------------
  |  Branch (229:26): [True: 5.27k, False: 2.66k]
  ------------------
  230|  5.27k|    std::vector<std::string>& result = pieces->emplace_back();
  231|  5.27k|    result.reserve(nbest.pieces().size());
  232|  62.3M|    for (const auto& sp : nbest.pieces()) {
  ------------------
  |  Branch (232:25): [True: 62.3M, False: 5.27k]
  ------------------
  233|  62.3M|      result.emplace_back(sp.piece());
  234|  62.3M|    }
  235|  5.27k|  }
  236|       |
  237|  2.66k|  return absl::OkStatus();
  238|  5.33k|}
_ZNK13sentencepiece22SentencePieceProcessor11NBestEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEiPNS1_6vectorINS6_IiNS1_9allocatorIiEEEENS7_IS9_EEEE:
  242|  1.32k|    std::vector<std::vector<int>>* ids) const {
  243|  2.64k|  RET_CHECK_STATUS_STL(ids);
  ------------------
  |  |  182|  1.32k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.32k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  2.64k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  2.64k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  2.64k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.32k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.32k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.32k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  2.64k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.32k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  2.64k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  2.64k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.32k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  2.64k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  1.32k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.32k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.32k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.32k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.32k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  1.32k|  container->clear();
  ------------------
  244|       |
  245|  2.64k|  Arena arena;
  246|  2.64k|  auto* spt = Arena::Create<NBestSentencePieceText>(&arena);
  247|  2.64k|  ABSL_RETURN_IF_ERROR(NBestEncode(input, nbest_size, spt));
  ------------------
  |  |   90|  1.32k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  2.64k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  2.64k|  switch (0)                                           \
  |  |  |  |  |  |  350|  2.64k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.32k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.32k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.32k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  2.64k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.32k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  2.64k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  2.64k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.32k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  2.64k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  248|  1.32k|  ids->reserve(spt->nbests().size());
  249|  3.02k|  for (const auto& nbest : spt->nbests()) {
  ------------------
  |  Branch (249:26): [True: 3.02k, False: 1.32k]
  ------------------
  250|  3.02k|    std::vector<int>& result = ids->emplace_back();
  251|  3.02k|    result.reserve(nbest.pieces().size());
  252|  28.9M|    for (const auto& sp : nbest.pieces()) {
  ------------------
  |  Branch (252:25): [True: 28.9M, False: 3.02k]
  ------------------
  253|  28.9M|      result.emplace_back(sp.id());
  254|  28.9M|    }
  255|  3.02k|  }
  256|       |
  257|  1.32k|  return absl::OkStatus();
  258|  2.64k|}
_ZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS1_6vectorINS1_12basic_stringIcS4_NS1_9allocatorIcEEEENS8_ISA_EEEE:
  262|  3.32k|    std::vector<std::string>* pieces) const {
  263|  6.64k|  RET_CHECK_STATUS_STL(pieces);
  ------------------
  |  |  182|  3.32k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  3.32k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  6.64k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  6.64k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  6.64k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 3.32k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  3.32k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.32k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  6.64k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 3.32k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  6.64k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  6.64k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  3.32k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  6.64k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  3.32k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  3.32k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 3.32k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  3.32k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  3.32k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  3.32k|  container->clear();
  ------------------
  264|       |
  265|  6.64k|  Arena arena;
  266|  6.64k|  auto* spt = Arena::Create<SentencePieceText>(&arena);
  267|  6.64k|  ABSL_RETURN_IF_ERROR(SampleEncode(input, nbest_size, alpha, spt));
  ------------------
  |  |   90|  3.32k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  6.64k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  6.64k|  switch (0)                                           \
  |  |  |  |  |  |  350|  6.64k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 3.32k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  3.32k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.32k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  6.64k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 3.32k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  6.64k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  6.64k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  3.32k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  6.64k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  268|  3.32k|  pieces->reserve(spt->pieces().size());
  269|  39.0M|  for (const auto& sp : spt->pieces()) {
  ------------------
  |  Branch (269:23): [True: 39.0M, False: 3.32k]
  ------------------
  270|  39.0M|    pieces->emplace_back(sp.piece());
  271|  39.0M|  }
  272|       |
  273|  3.32k|  return absl::OkStatus();
  274|  6.64k|}
_ZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS1_6vectorIiNS1_9allocatorIiEEEE:
  278|  1.23k|                                                  std::vector<int>* ids) const {
  279|  2.47k|  RET_CHECK_STATUS_STL(ids);
  ------------------
  |  |  182|  1.23k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.23k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  2.47k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  2.47k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  2.47k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.23k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.23k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.23k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  2.47k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.23k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  2.47k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  2.47k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.23k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  2.47k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  1.23k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.23k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.23k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.23k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.23k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  1.23k|  container->clear();
  ------------------
  280|       |
  281|  2.47k|  Arena arena;
  282|  2.47k|  auto* spt = Arena::Create<SentencePieceText>(&arena);
  283|  2.47k|  ABSL_RETURN_IF_ERROR(SampleEncode(input, nbest_size, alpha, spt));
  ------------------
  |  |   90|  1.23k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  2.47k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  2.47k|  switch (0)                                           \
  |  |  |  |  |  |  350|  2.47k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.23k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.23k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.23k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  2.47k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.23k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  2.47k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  2.47k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.23k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  2.47k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  284|  20.4M|  for (const auto& sp : spt->pieces()) {
  ------------------
  |  Branch (284:23): [True: 20.4M, False: 1.23k]
  ------------------
  285|  20.4M|    ids->emplace_back(sp.id());
  286|  20.4M|  }
  287|       |
  288|  1.23k|  return absl::OkStatus();
  289|  2.47k|}
_ZNK13sentencepiece22SentencePieceProcessor25PopulateSentencePieceTextENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_N4absl12lts_202608174SpanIKmEERKNS1_6vectorINS1_4pairIS5_iEENS1_9allocatorISD_EEEEPNS_17SentencePieceTextEbm:
  295|  12.8k|    size_t input_start_offset) const {
  296|  12.8k|  size_t consumed = 0;
  297|  12.8k|  bool is_prev_unk = false;
  298|  95.1M|  for (const auto& p : result) {
  ------------------
  |  Branch (298:22): [True: 95.1M, False: 12.8k]
  ------------------
  299|  95.1M|    const absl::string_view w = p.first;  // piece
  300|  95.1M|    const int id = p.second;              // id
  301|       |
  302|  95.1M|    RET_CHECK(!w.empty()) << "Empty piece is not allowed.";
  ------------------
  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  ------------------
  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  303|       |
  304|  95.1M|    const bool is_unk = IsUnknownId(*model_, unk_id_, id);
  305|       |
  306|  95.1M|    if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (306:9): [True: 0, False: 95.1M]
  ------------------
  307|       |      // Control symbol has no corresponding source surface, so begin == end.
  308|      0|      auto* sp = spt->add_pieces();
  309|      0|      sp->set_piece(w.data(), w.size());
  310|      0|      sp->set_id(id);
  311|      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 << "] "
  |  |  ------------------
  ------------------
  312|      0|      const size_t orig_offset = norm_to_orig[consumed] - input_start_offset;
  313|      0|      sp->set_begin(orig_offset);
  314|      0|      sp->set_end(orig_offset);
  315|  95.1M|    } else {
  316|  95.1M|      const size_t begin = consumed;
  317|  95.1M|      const size_t end = consumed + w.size();
  318|  95.1M|      RET_CHECK_LT(begin, norm_to_orig.size());
  ------------------
  |  |   33|  95.1M|#define RET_CHECK_LT(a, b) RET_CHECK((a) < (b))
  |  |  ------------------
  |  |  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  319|  95.1M|      RET_CHECK_LT(end, norm_to_orig.size());
  ------------------
  |  |   33|  95.1M|#define RET_CHECK_LT(a, b) RET_CHECK((a) < (b))
  |  |  ------------------
  |  |  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  320|  95.1M|      RET_CHECK_GE(norm_to_orig[begin], input_start_offset);
  ------------------
  |  |   30|  95.1M|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  321|  95.1M|      RET_CHECK_GE(norm_to_orig[end], input_start_offset);
  ------------------
  |  |   30|  95.1M|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  322|  95.1M|      const size_t orig_begin = norm_to_orig[begin] - input_start_offset;
  323|  95.1M|      const size_t orig_end = norm_to_orig[end] - input_start_offset;
  324|  95.1M|      RET_CHECK_LE(orig_begin, input.size());
  ------------------
  |  |   31|  95.1M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  325|  95.1M|      RET_CHECK_LE(orig_end, input.size());
  ------------------
  |  |   31|  95.1M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  326|  95.1M|      RET_CHECK_LE(orig_begin, orig_end);
  ------------------
  |  |   31|  95.1M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  95.1M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 95.1M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  95.1M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  95.1M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  327|  95.1M|      const auto surface =
  328|  95.1M|          absl::ClippedSubstr(input, orig_begin, orig_end - orig_begin);
  329|       |
  330|  95.1M|      if (is_unk && model_->ByteFallbackEnabled()) {
  ------------------
  |  Branch (330:11): [True: 74.7M, False: 20.3M]
  |  Branch (330:21): [True: 74.7M, False: 0]
  ------------------
  331|       |        // Decomposes an unknown piece into UTF-8 bytes
  332|   205M|        for (size_t i = 0; i < w.size(); ++i) {
  ------------------
  |  Branch (332:28): [True: 130M, False: 74.7M]
  ------------------
  333|       |          // Create a byte piece
  334|   130M|          const uint8_t b = static_cast<uint8_t>(w[i]);
  335|   130M|          SentencePieceText::SentencePiece* sp = spt->add_pieces();
  336|   130M|          std::string& piece = *sp->mutable_piece();
  337|   130M|          piece = ByteToPiece(b);
  338|   130M|          int sp_id = model_->PieceToId(piece);
  339|   130M|          sp->set_id(sp_id);
  340|       |
  341|       |          // The last byte piece holds the surface of the original unknown
  342|       |          // character. The other byte pieces have no surface.
  343|   130M|          if (i == w.size() - 1) {
  ------------------
  |  Branch (343:15): [True: 74.7M, False: 55.6M]
  ------------------
  344|  74.7M|            if (!skip_surface) sp->set_surface(surface.data(), surface.size());
  ------------------
  |  Branch (344:17): [True: 74.7M, False: 0]
  ------------------
  345|  74.7M|            sp->set_begin(orig_begin);
  346|  74.7M|            sp->set_end(orig_end);
  347|  74.7M|          } else {
  348|       |            // begin == end
  349|  55.6M|            sp->set_begin(orig_begin);
  350|  55.6M|            sp->set_end(orig_begin);
  351|  55.6M|          }
  352|   130M|        }
  353|  74.7M|      } else {
  354|       |        // Merges continuous run of unknown pieces so that decoder
  355|       |        // can copy or generate unknown tokens easily.
  356|       |        // Note that merged tokens are still unknown,
  357|       |        // since known pieces never consist of unknown characters.
  358|  20.3M|        if (is_prev_unk && is_unk) {
  ------------------
  |  Branch (358:13): [True: 7.05M, False: 13.3M]
  |  Branch (358:28): [True: 0, False: 7.05M]
  ------------------
  359|      0|          auto* sp = spt->mutable_pieces(spt->pieces_size() - 1);
  360|      0|          sp->mutable_piece()->append(w);
  361|      0|          if (!skip_surface) sp->mutable_surface()->append(surface);
  ------------------
  |  Branch (361:15): [True: 0, False: 0]
  ------------------
  362|      0|          sp->set_end(orig_end);
  363|  20.3M|        } else {
  364|  20.3M|          auto* sp = spt->add_pieces();
  365|  20.3M|          sp->set_piece(w.data(), w.size());
  366|  20.3M|          sp->set_id(id);
  367|  20.3M|          if (!skip_surface) sp->set_surface(surface.data(), surface.size());
  ------------------
  |  Branch (367:15): [True: 20.3M, False: 0]
  ------------------
  368|  20.3M|          sp->set_begin(orig_begin);
  369|  20.3M|          sp->set_end(orig_end);
  370|  20.3M|        }
  371|  20.3M|      }
  372|  95.1M|      consumed += w.size();
  373|  95.1M|    }
  374|  95.1M|    is_prev_unk = is_unk;
  375|  95.1M|  }
  376|       |
  377|  12.8k|  RET_CHECK_EQ(consumed, normalized.size())
  ------------------
  |  |   28|  12.8k|#define RET_CHECK_EQ(a, b) RET_CHECK((a) == (b))
  |  |  ------------------
  |  |  |  |   23|  12.8k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 12.8k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  12.8k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  12.8k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  378|      0|      << "all normalized characters are not consumed.";
  379|       |
  380|  12.8k|  spt->set_text(input.data(), input.size());
  381|       |
  382|  12.8k|  ABSL_RETURN_IF_ERROR(ApplyExtraOptions(encode_extra_options_, spt));
  ------------------
  |  |   90|  12.8k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  25.7k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  25.7k|  switch (0)                                           \
  |  |  |  |  |  |  350|  25.7k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 12.8k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  12.8k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 12.8k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  25.7k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 12.8k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  25.7k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  25.7k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  12.8k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  25.7k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  383|       |
  384|  12.8k|  return absl::OkStatus();
  385|  12.8k|}  // namespace sentencepiece
_ZNK13sentencepiece22SentencePieceProcessor11NBestEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEiPNS_22NBestSentencePieceTextE:
  405|  3.98k|    NBestSentencePieceText* nbest_spt) const {
  406|  7.97k|  RET_CHECK_STATUS_PROTO(nbest_spt);
  ------------------
  |  |  187|  3.98k|  ABSL_RETURN_IF_ERROR(status());             \
  |  |  ------------------
  |  |  |  |   90|  3.98k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  7.97k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  7.97k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  7.97k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 3.98k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  3.98k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.98k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  7.97k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 3.98k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  7.97k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  7.97k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  3.98k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  7.97k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  188|  3.98k|  RET_CHECK(proto) << "output proto is null"; \
  |  |  ------------------
  |  |  |  |   23|  3.98k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 3.98k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  3.98k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  3.98k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  189|  3.98k|  proto->Clear();
  ------------------
  407|       |
  408|  7.97k|  RET_CHECK_LE(nbest_size, kMaxNBestSize)
  ------------------
  |  |   31|  3.98k|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  3.98k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 3.98k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  3.98k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  3.98k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  409|      0|      << "nbest_size must be nbest_size <= " << kMaxNBestSize;
  410|       |
  411|  3.98k|  std::string normalized;
  412|  3.98k|  std::vector<size_t> norm_to_orig;
  413|  3.98k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  3.98k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  7.97k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  7.97k|  switch (0)                                           \
  |  |  |  |  |  |  350|  7.97k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 3.98k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  3.98k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.98k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  7.97k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 3.98k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  7.97k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  7.97k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  3.98k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  7.97k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  414|  3.98k|      normalizer_->Normalize(input, &normalized, &norm_to_orig));
  415|       |
  416|  3.98k|  RET_CHECK(model_->IsNBestEncodeAvailable())
  ------------------
  |  |   23|  3.98k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 3.98k, False: 0]
  |  |  ------------------
  |  |   24|  3.98k|  } else /* NOLINT */                                         \
  |  |   25|  3.98k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  417|      0|      << "NBestEncode is not available for the current model.";
  418|       |
  419|  3.98k|  const auto nbests = model_->NBestEncode(normalized, nbest_size);
  420|  3.98k|  RET_CHECK(!nbests.empty()) << "NBestEncode returns empty result.";
  ------------------
  |  |   23|  3.98k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 3.98k, False: 0]
  |  |  ------------------
  |  |   24|  3.98k|  } else /* NOLINT */                                         \
  |  |   25|  3.98k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  421|       |
  422|  8.29k|  for (const auto& result : nbests) {
  ------------------
  |  Branch (422:27): [True: 8.29k, False: 3.98k]
  ------------------
  423|  8.29k|    auto* spt = nbest_spt->add_nbests();
  424|  8.29k|    spt->set_score(result.second);
  425|  8.29k|    ABSL_RETURN_IF_ERROR(PopulateSentencePieceText(
  ------------------
  |  |   90|  8.29k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  16.5k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  16.5k|  switch (0)                                           \
  |  |  |  |  |  |  350|  16.5k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 8.29k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  8.29k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 8.29k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  16.5k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 8.29k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  16.5k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  16.5k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  8.29k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  16.5k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  426|  8.29k|        input, normalized, norm_to_orig, result.first, spt));
  427|  8.29k|  }
  428|       |
  429|  3.98k|  return absl::OkStatus();
  430|  3.98k|}
_ZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS_17SentencePieceTextE:
  434|  4.55k|    SentencePieceText* spt) const {
  435|  9.11k|  RET_CHECK_STATUS_PROTO(spt);
  ------------------
  |  |  187|  4.55k|  ABSL_RETURN_IF_ERROR(status());             \
  |  |  ------------------
  |  |  |  |   90|  4.55k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  9.11k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  9.11k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  9.11k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 4.55k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  4.55k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 4.55k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  9.11k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 4.55k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  9.11k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  9.11k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  4.55k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  9.11k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  188|  4.55k|  RET_CHECK(proto) << "output proto is null"; \
  |  |  ------------------
  |  |  |  |   23|  4.55k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 4.55k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  4.55k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  4.55k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  189|  4.55k|  proto->Clear();
  ------------------
  436|       |
  437|  9.11k|  RET_CHECK(!std::isnan(alpha));
  ------------------
  |  |   23|  4.55k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 4.55k, False: 0]
  |  |  ------------------
  |  |   24|  4.55k|  } else /* NOLINT */                                         \
  |  |   25|  4.55k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  438|  4.55k|  RET_CHECK_GE(alpha, 0.0);
  ------------------
  |  |   30|  4.55k|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  4.55k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 4.55k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  4.55k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  4.55k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  439|  4.55k|  RET_CHECK_LE(nbest_size, kMaxNBestSize)
  ------------------
  |  |   31|  4.55k|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  4.55k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 4.55k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  4.55k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  4.55k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  440|      0|      << "nbest_size must be nbest_size <= " << kMaxNBestSize;
  441|       |
  442|  4.55k|  std::string normalized;
  443|  4.55k|  std::vector<size_t> norm_to_orig;
  444|  4.55k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  4.55k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  9.11k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  9.11k|  switch (0)                                           \
  |  |  |  |  |  |  350|  9.11k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 4.55k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  4.55k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 4.55k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  9.11k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 4.55k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  9.11k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  9.11k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  4.55k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  9.11k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  445|  4.55k|      normalizer_->Normalize(input, &normalized, &norm_to_orig));
  446|       |
  447|  4.55k|  if (!model_->IsNBestEncodeAvailable() || nbest_size < 0) {
  ------------------
  |  Branch (447:7): [True: 0, False: 4.55k]
  |  Branch (447:44): [True: 3.82k, False: 738]
  ------------------
  448|  3.82k|    RET_CHECK(model_->IsSampleEncodeAvailable())
  ------------------
  |  |   23|  3.82k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 3.82k, False: 0]
  |  |  ------------------
  |  |   24|  3.82k|  } else /* NOLINT */                                         \
  |  |   25|  3.82k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  449|      0|        << "SampleEncode is not available for the current model.";
  450|  3.82k|    const auto result = model_->SampleEncode(normalized, alpha);
  451|  3.82k|    ABSL_RETURN_IF_ERROR(PopulateSentencePieceText(input, normalized,
  ------------------
  |  |   90|  3.82k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  7.64k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  7.64k|  switch (0)                                           \
  |  |  |  |  |  |  350|  7.64k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 3.82k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  3.82k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.82k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  7.64k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 3.82k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  7.64k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  7.64k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  3.82k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  7.64k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  452|  3.82k|                                                   norm_to_orig, result, spt));
  453|  3.82k|  } else if (nbest_size == 1 || nbest_size == 0) {
  ------------------
  |  Branch (453:14): [True: 0, False: 738]
  |  Branch (453:33): [True: 0, False: 738]
  ------------------
  454|      0|    const auto result = model_->Encode(normalized);
  455|      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()
  |  |  ------------------
  ------------------
  456|      0|                                                   norm_to_orig, result, spt));
  457|    738|  } else if (nbest_size > 1) {
  ------------------
  |  Branch (457:14): [True: 738, False: 0]
  ------------------
  458|    738|    const auto nbests = model_->NBestEncode(normalized, nbest_size);
  459|    738|    RET_CHECK(!nbests.empty()) << "NBestEncode returns empty result.";
  ------------------
  |  |   23|    738|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 738, False: 0]
  |  |  ------------------
  |  |   24|    738|  } else /* NOLINT */                                         \
  |  |   25|    738|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  460|       |
  461|    738|    std::vector<double> log_probs;
  462|    738|    log_probs.reserve(nbests.size());
  463|    738|    std::transform(nbests.begin(), nbests.end(), std::back_inserter(log_probs),
  464|    738|                   [alpha](const auto& nbest) { return alpha * nbest.second; });
  465|       |
  466|    738|    const double Z = log_domain::LogSum(log_probs);
  467|    738|    std::vector<double> probs;
  468|    738|    probs.reserve(log_probs.size());
  469|    738|    std::transform(
  470|    738|        log_probs.begin(), log_probs.end(), std::back_inserter(probs),
  471|    738|        [Z](const auto& log_prob) { return std::exp(log_prob - Z); });
  472|       |
  473|    738|    auto* mt = random::GetRandomGenerator();
  474|    738|    std::discrete_distribution<int> dist(probs.begin(), probs.end());
  475|    738|    ABSL_RETURN_IF_ERROR(PopulateSentencePieceText(
  ------------------
  |  |   90|    738|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  1.47k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  1.47k|  switch (0)                                           \
  |  |  |  |  |  |  350|  1.47k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 738, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|    738|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 738]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  1.47k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 738, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  1.47k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  1.47k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|    738|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  1.47k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  476|    738|        input, normalized, norm_to_orig, nbests[dist(*mt)].first, spt));
  477|    738|  }
  478|       |
  479|  4.55k|  return absl::OkStatus();
  480|  4.55k|}
_ZNK13sentencepiece22SentencePieceProcessor9NormalizeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_12basic_stringIcS4_NS1_9allocatorIcEEEE:
 1040|  1.47k|                                               std::string* normalized) const {
 1041|  1.47k|  RET_CHECK(normalizer_);
  ------------------
  |  |   23|  1.47k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 1.47k, False: 0]
  |  |  ------------------
  |  |   24|  1.47k|  } else /* NOLINT */                                         \
  |  |   25|  1.47k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1042|  1.47k|  return normalizer_->Normalize(input, normalized, nullptr);
 1043|  1.47k|}
_ZNK13sentencepiece22SentencePieceProcessor9NormalizeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_12basic_stringIcS4_NS1_9allocatorIcEEEEPNS1_6vectorImNS7_ImEEEE:
 1047|  1.47k|    std::vector<size_t>* norm_to_orig) const {
 1048|  1.47k|  RET_CHECK(normalizer_);
  ------------------
  |  |   23|  1.47k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 1.47k, False: 0]
  |  |  ------------------
  |  |   24|  1.47k|  } else /* NOLINT */                                         \
  |  |   25|  1.47k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1049|  1.47k|  return normalizer_->Normalize(input, normalized, norm_to_orig);
 1050|  1.47k|}
_ZNK13sentencepiece22SentencePieceProcessor12GetPieceSizeEv:
 1058|  10.3k|int SentencePieceProcessor::GetPieceSize() const {
 1059|  10.3k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1034|  10.3k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 10.3k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1060|  10.3k|  return model_->GetPieceSize();
 1061|  10.3k|}
_ZNK13sentencepiece22SentencePieceProcessor9PieceToIdENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
 1063|  11.8k|int SentencePieceProcessor::PieceToId(absl::string_view piece) const {
 1064|  11.8k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1034|  11.8k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 11.8k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1065|  11.8k|  return model_->PieceToId(piece);
 1066|  11.8k|}
_ZNK13sentencepiece22SentencePieceProcessor9IdToPieceEi:
 1068|  10.3k|const std::string& SentencePieceProcessor::IdToPiece(int id) const {
 1069|  10.3k|  static const std::string* kEmptyString = new std::string;
 1070|  10.3k|  RET_CHECK_OR_RETURN_DEFAULT(*kEmptyString);
  ------------------
  |  | 1034|  10.3k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 10.3k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1071|  10.3k|  return model_->IdToPiece(id);
 1072|  10.3k|}
_ZNK13sentencepiece22SentencePieceProcessor8GetScoreEi:
 1083|  10.3k|float SentencePieceProcessor::GetScore(int id) const {
 1084|  10.3k|  RET_CHECK_OR_RETURN_DEFAULT(0.0);
  ------------------
  |  | 1034|  10.3k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 10.3k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1085|  10.3k|  return model_->GetScore(id);
 1086|  10.3k|}
_ZNK13sentencepiece22SentencePieceProcessor9IsControlEi:
 1088|  10.3k|bool SentencePieceProcessor::IsControl(int id) const {
 1089|  10.3k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1034|  10.3k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 10.3k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1090|  10.3k|  return id >= 0 && model_->IsControl(id);
  ------------------
  |  Branch (1090:10): [True: 10.3k, False: 0]
  |  Branch (1090:21): [True: 6, False: 10.3k]
  ------------------
 1091|  10.3k|}
_ZNK13sentencepiece22SentencePieceProcessor9IsUnknownEi:
 1093|  10.3k|bool SentencePieceProcessor::IsUnknown(int id) const {
 1094|  10.3k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1034|  10.3k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 10.3k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1095|  10.3k|  return id == unk_id_ || (id >= 0 && model_->IsUnknown(id));
  ------------------
  |  Branch (1095:10): [True: 9.92k, False: 458]
  |  Branch (1095:28): [True: 458, False: 0]
  |  Branch (1095:39): [True: 0, False: 458]
  ------------------
 1096|  10.3k|}
_ZNK13sentencepiece22SentencePieceProcessor8IsUnusedEi:
 1098|  10.3k|bool SentencePieceProcessor::IsUnused(int id) const {
 1099|  10.3k|  RET_CHECK_OR_RETURN_DEFAULT(false);
  ------------------
  |  | 1034|  10.3k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 10.3k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1100|  10.3k|  return model_->IsUnused(id);
 1101|  10.3k|}
_ZNK13sentencepiece22SentencePieceProcessor6IsByteEi:
 1103|  10.3k|bool SentencePieceProcessor::IsByte(int id) const {
 1104|  10.3k|  RET_CHECK_OR_RETURN_DEFAULT(false);
  ------------------
  |  | 1034|  10.3k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1034:7): [True: 0, False: 10.3k]
  |  |  ------------------
  |  | 1035|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1036|      0|    return value;                                                            \
  |  | 1037|      0|  }
  ------------------
 1105|  10.3k|  return model_->IsByte(id);
 1106|  10.3k|}
_ZNK13sentencepiece22SentencePieceProcessor17HasUnkPieceOptionEv:
 1195|  4.16k|bool SentencePieceProcessor::HasUnkPieceOption() const {
 1196|  4.16k|  for (const auto& option : encode_extra_options_) {
  ------------------
  |  Branch (1196:27): [True: 0, False: 4.16k]
  ------------------
 1197|      0|    if (option == UNK_PIECE) return true;
  ------------------
  |  Branch (1197:9): [True: 0, False: 0]
  ------------------
 1198|      0|  }
 1199|  4.16k|  return false;
 1200|  4.16k|}
sentencepiece_processor.cc:_ZN13sentencepiece12_GLOBAL__N_111IsUnknownIdERKNS_14ModelInterfaceEii:
   80|   171M|inline bool IsUnknownId(const ModelInterface& model, int unk_id, int id) {
   81|   171M|  return id == unk_id || (id >= 0 && model.IsUnknown(id));
  ------------------
  |  Branch (81:10): [True: 121M, False: 49.3M]
  |  Branch (81:27): [True: 49.3M, False: 0]
  |  Branch (81:38): [True: 0, False: 49.3M]
  ------------------
   82|   171M|}
sentencepiece_processor.cc:_ZN13sentencepiece12_GLOBAL__N_111IsControlIdERKNS_14ModelInterfaceEi:
   72|   171M|inline bool IsControlId(const ModelInterface& model, int id) {
   73|   171M|  return id >= 0 && model.IsControl(id);
  ------------------
  |  Branch (73:10): [True: 171M, False: 0]
  |  Branch (73:21): [True: 0, False: 171M]
  ------------------
   74|   171M|}
sentencepiece_processor.cc:_ZZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS_17SentencePieceTextEENK3$_0clINS1_4pairINS1_6vectorINSA_IS5_iEENS1_9allocatorISC_EEEEfEEEEDaRKT_:
  464|  2.34k|                   [alpha](const auto& nbest) { return alpha * nbest.second; });
sentencepiece_processor.cc:_ZZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS_17SentencePieceTextEENK3$_1clIdEEDaRKT_:
  471|  2.34k|        [Z](const auto& log_prob) { return std::exp(log_prob - Z); });
sentencepiece_processor.cc:_ZN13sentencepiece12_GLOBAL__N_18IsByteIdERKNS_14ModelInterfaceEi:
   76|  76.9M|inline bool IsByteId(const ModelInterface& model, int id) {
   77|  76.9M|  return id >= 0 && model.IsByte(id);
  ------------------
  |  Branch (77:10): [True: 76.9M, False: 0]
  |  Branch (77:21): [True: 63.7M, False: 13.1M]
  ------------------
   78|  76.9M|}
_ZNK13sentencepiece22SentencePieceProcessor15EncodeOptimizedINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEEEN4absl12lts_202608176StatusENS2_17basic_string_viewIcS5_EEPNS2_6vectorIT_NS6_ISF_EEEE:
 1256|  2.74k|    absl::string_view input, std::vector<T>* output) const {
 1257|  5.49k|  RET_CHECK_STATUS_STL(output);
  ------------------
  |  |  182|  2.74k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  2.74k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  5.49k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  5.49k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  5.49k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 2.74k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  2.74k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 2.74k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  5.49k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 2.74k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  5.49k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  5.49k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  2.74k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  5.49k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  2.74k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  2.74k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 2.74k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  2.74k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  2.74k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  2.74k|  container->clear();
  ------------------
 1258|       |
 1259|  5.49k|  if (input.empty()) {
  ------------------
  |  Branch (1259:7): [True: 0, False: 2.74k]
  ------------------
 1260|      0|    return ApplyExtraOptions(encode_extra_options_, output);
 1261|      0|  }
 1262|       |
 1263|  2.74k|  std::string normalized;
 1264|  2.74k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  2.74k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  5.49k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  5.49k|  switch (0)                                           \
  |  |  |  |  |  |  350|  5.49k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 2.74k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  2.74k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 2.74k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  5.49k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 2.74k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  5.49k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  5.49k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  2.74k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  5.49k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1265|  2.74k|      normalizer_->Normalize(input, &normalized, /*norm_to_orig=*/nullptr));
 1266|  2.74k|  const EncodeResult result = model_->Encode(normalized);
 1267|  2.74k|  const bool byte_fallback_enabled = model_->ByteFallbackEnabled();
 1268|  2.74k|  const bool has_unk_piece = HasUnkPieceOption();
 1269|  2.74k|  bool is_prev_unk = false;
 1270|  2.74k|  output->reserve(result.size());
 1271|       |
 1272|  41.7M|  for (const auto& piece : result) {
  ------------------
  |  Branch (1272:26): [True: 41.7M, False: 2.74k]
  ------------------
 1273|  41.7M|    const absl::string_view w = piece.first;
 1274|  41.7M|    RET_CHECK(!piece.first.empty()) << "Empty piece is not allowed.";
  ------------------
  |  |   23|  41.7M|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 41.7M, False: 0]
  |  |  ------------------
  |  |   24|  41.7M|  } else /* NOLINT */                                         \
  |  |   25|  41.7M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1275|  41.7M|    const int id = piece.second;
 1276|  41.7M|    if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1276:9): [True: 0, False: 41.7M]
  ------------------
 1277|       |      if constexpr (std::is_same_v<T, int>) {
 1278|       |        output->emplace_back(id);
 1279|      0|      } else {
 1280|      0|        output->emplace_back(w.data(), w.size());
 1281|      0|      }
 1282|      0|      is_prev_unk = false;
 1283|  41.7M|    } else {
 1284|  41.7M|      const bool is_unk = IsUnknownId(*model_, unk_id_, id);
 1285|  41.7M|      if (is_unk && byte_fallback_enabled) {
  ------------------
  |  Branch (1285:11): [True: 31.4M, False: 10.2M]
  |  Branch (1285:21): [True: 31.4M, False: 0]
  ------------------
 1286|  84.0M|        for (size_t i = 0; i < w.size(); ++i) {
  ------------------
  |  Branch (1286:28): [True: 52.5M, False: 31.4M]
  ------------------
 1287|       |          if constexpr (std::is_same_v<T, int>) {
 1288|       |            const auto sp_id =
 1289|       |                model_->PieceToId(ByteToPiece(static_cast<uint8_t>(w[i])));
 1290|       |            output->emplace_back(sp_id);
 1291|  52.5M|          } else {
 1292|  52.5M|            output->emplace_back(ByteToPiece(static_cast<uint8_t>(w[i])));
 1293|  52.5M|          }
 1294|  52.5M|        }
 1295|  31.4M|      } else {
 1296|       |        // Merge continuous runs of unknown pieces.
 1297|  10.2M|        if (!is_prev_unk || !is_unk) {
  ------------------
  |  Branch (1297:13): [True: 7.70M, False: 2.58M]
  |  Branch (1297:29): [True: 2.58M, False: 0]
  ------------------
 1298|       |          if constexpr (std::is_same_v<T, int>) {
 1299|       |            output->emplace_back(id);
 1300|  10.2M|          } else {
 1301|  10.2M|            if (is_unk && has_unk_piece) {
  ------------------
  |  Branch (1301:17): [True: 0, False: 10.2M]
  |  Branch (1301:27): [True: 0, False: 0]
  ------------------
 1302|      0|              output->emplace_back(model_->unk_piece());
 1303|  10.2M|            } else {
 1304|  10.2M|              output->emplace_back(w.data(), w.size());
 1305|  10.2M|            }
 1306|  10.2M|          }
 1307|  10.2M|        } else {
 1308|      0|          if constexpr (!std::is_same_v<T, int>) {
 1309|      0|            if (!has_unk_piece) {
  ------------------
  |  Branch (1309:17): [True: 0, False: 0]
  ------------------
 1310|      0|              output->back().append(w.data(), w.size());
 1311|      0|            }
 1312|      0|          }
 1313|      0|        }
 1314|  10.2M|      }
 1315|  41.7M|      is_prev_unk = is_unk;
 1316|  41.7M|    }
 1317|  41.7M|  }
 1318|       |
 1319|  2.74k|  return ApplyExtraOptions(encode_extra_options_, output);
 1320|  2.74k|}
_ZNK13sentencepiece22SentencePieceProcessor17ApplyExtraOptionsINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEEEN4absl12lts_202608176StatusENSD_4SpanIKNS0_11ExtraOptionEEEPT_:
 1118|  2.74k|    absl::Span<const ExtraOption> extra_options, T* output) const {
 1119|  2.74k|  for (const auto& extra_option : extra_options) {
  ------------------
  |  Branch (1119:33): [True: 0, False: 2.74k]
  ------------------
 1120|      0|    switch (extra_option) {
 1121|      0|      case REVERSE:
  ------------------
  |  Branch (1121:7): [True: 0, False: 0]
  ------------------
 1122|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1123|       |          std::reverse(output->mutable_pieces()->begin(),
 1124|       |                       output->mutable_pieces()->end());
 1125|      0|        } else {
 1126|      0|          std::reverse(output->begin(), output->end());
 1127|      0|        }
 1128|      0|        break;
 1129|      0|      case EOS:
  ------------------
  |  Branch (1129:7): [True: 0, False: 0]
  ------------------
 1130|      0|        if (const int id = eos_id(); id != -1) {
  ------------------
  |  Branch (1130:38): [True: 0, False: 0]
  ------------------
 1131|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1132|       |            auto* piece = output->add_pieces();
 1133|       |            piece->set_id(id);
 1134|       |            piece->set_piece(model_->eos_piece().data(),
 1135|       |                             model_->eos_piece().size());
 1136|       |            piece->set_begin(output->text().size());
 1137|       |            piece->set_end(output->text().size());
 1138|      0|          } else {
 1139|      0|            using V = typename T::value_type;
 1140|       |            if constexpr (std::is_same_v<V, int>) {
 1141|       |              output->emplace_back(id);
 1142|      0|            } else {
 1143|      0|              output->emplace_back(model_->eos_piece());
 1144|      0|            }
 1145|      0|          }
 1146|      0|        }
 1147|      0|        break;
 1148|      0|      case BOS:
  ------------------
  |  Branch (1148:7): [True: 0, False: 0]
  ------------------
 1149|      0|        if (const int id = bos_id(); id != -1) {
  ------------------
  |  Branch (1149:38): [True: 0, False: 0]
  ------------------
 1150|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1151|       |            auto* array = output->mutable_pieces();
 1152|       |            array->Add();
 1153|       |            for (int i = array->size() - 1; i > 0; --i) {
 1154|       |              array->SwapElements(i - 1, i);
 1155|       |            }
 1156|       |            auto* piece = array->Mutable(0);
 1157|       |            piece->set_id(id);
 1158|       |            piece->set_piece(model_->bos_piece().data(),
 1159|       |                             model_->bos_piece().size());
 1160|       |            piece->set_begin(0);
 1161|       |            piece->set_end(0);
 1162|      0|          } else {
 1163|      0|            using V = typename T::value_type;
 1164|       |            if constexpr (std::is_same_v<V, int>) {
 1165|       |              output->emplace(output->begin(), id);
 1166|      0|            } else {
 1167|      0|              output->emplace(output->begin(), model_->bos_piece());
 1168|      0|            }
 1169|      0|          }
 1170|      0|        }
 1171|      0|        break;
 1172|      0|      case UNK_PIECE:
  ------------------
  |  Branch (1172:7): [True: 0, False: 0]
  ------------------
 1173|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1174|       |          for (int i = 0; i < output->pieces_size(); ++i) {
 1175|       |            auto* piece = output->mutable_pieces(i);
 1176|       |            if (IsUnknownId(*model_, unk_id_, piece->id())) {
 1177|       |              piece->set_piece(model_->unk_piece().data(),
 1178|       |                               model_->unk_piece().size());
 1179|       |            }
 1180|       |          }
 1181|       |        }
 1182|      0|        break;
 1183|      0|      default:
  ------------------
  |  Branch (1183:7): [True: 0, False: 0]
  ------------------
 1184|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1185|       |          output->Clear();
 1186|      0|        } else {
 1187|      0|          output->clear();
 1188|      0|        }
 1189|      0|        return absl::InternalError("unknown extra_option type.");
 1190|      0|    }
 1191|      0|  }
 1192|  2.74k|  return absl::OkStatus();
 1193|  2.74k|}
_ZNK13sentencepiece22SentencePieceProcessor15EncodeOptimizedIiEEN4absl12lts_202608176StatusENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEPNS5_6vectorIT_NS5_9allocatorISB_EEEE:
 1256|  1.42k|    absl::string_view input, std::vector<T>* output) const {
 1257|  2.84k|  RET_CHECK_STATUS_STL(output);
  ------------------
  |  |  182|  1.42k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.42k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  2.84k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  2.84k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  2.84k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.42k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.42k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.42k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  2.84k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.42k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  2.84k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  2.84k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.42k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  2.84k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  1.42k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.42k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.42k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.42k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.42k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  1.42k|  container->clear();
  ------------------
 1258|       |
 1259|  2.84k|  if (input.empty()) {
  ------------------
  |  Branch (1259:7): [True: 0, False: 1.42k]
  ------------------
 1260|      0|    return ApplyExtraOptions(encode_extra_options_, output);
 1261|      0|  }
 1262|       |
 1263|  1.42k|  std::string normalized;
 1264|  1.42k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  1.42k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  2.84k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  2.84k|  switch (0)                                           \
  |  |  |  |  |  |  350|  2.84k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.42k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.42k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.42k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  2.84k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.42k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  2.84k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  2.84k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.42k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  2.84k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1265|  1.42k|      normalizer_->Normalize(input, &normalized, /*norm_to_orig=*/nullptr));
 1266|  1.42k|  const EncodeResult result = model_->Encode(normalized);
 1267|  1.42k|  const bool byte_fallback_enabled = model_->ByteFallbackEnabled();
 1268|  1.42k|  const bool has_unk_piece = HasUnkPieceOption();
 1269|  1.42k|  bool is_prev_unk = false;
 1270|  1.42k|  output->reserve(result.size());
 1271|       |
 1272|  21.0M|  for (const auto& piece : result) {
  ------------------
  |  Branch (1272:26): [True: 21.0M, False: 1.42k]
  ------------------
 1273|  21.0M|    const absl::string_view w = piece.first;
 1274|  21.0M|    RET_CHECK(!piece.first.empty()) << "Empty piece is not allowed.";
  ------------------
  |  |   23|  21.0M|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 21.0M, False: 0]
  |  |  ------------------
  |  |   24|  21.0M|  } else /* NOLINT */                                         \
  |  |   25|  21.0M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1275|  21.0M|    const int id = piece.second;
 1276|  21.0M|    if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1276:9): [True: 0, False: 21.0M]
  ------------------
 1277|      0|      if constexpr (std::is_same_v<T, int>) {
 1278|      0|        output->emplace_back(id);
 1279|       |      } else {
 1280|       |        output->emplace_back(w.data(), w.size());
 1281|       |      }
 1282|      0|      is_prev_unk = false;
 1283|  21.0M|    } else {
 1284|  21.0M|      const bool is_unk = IsUnknownId(*model_, unk_id_, id);
 1285|  21.0M|      if (is_unk && byte_fallback_enabled) {
  ------------------
  |  Branch (1285:11): [True: 15.6M, False: 5.46M]
  |  Branch (1285:21): [True: 15.6M, False: 0]
  ------------------
 1286|  42.8M|        for (size_t i = 0; i < w.size(); ++i) {
  ------------------
  |  Branch (1286:28): [True: 27.2M, False: 15.6M]
  ------------------
 1287|  27.2M|          if constexpr (std::is_same_v<T, int>) {
 1288|  27.2M|            const auto sp_id =
 1289|  27.2M|                model_->PieceToId(ByteToPiece(static_cast<uint8_t>(w[i])));
 1290|  27.2M|            output->emplace_back(sp_id);
 1291|       |          } else {
 1292|       |            output->emplace_back(ByteToPiece(static_cast<uint8_t>(w[i])));
 1293|       |          }
 1294|  27.2M|        }
 1295|  15.6M|      } else {
 1296|       |        // Merge continuous runs of unknown pieces.
 1297|  5.46M|        if (!is_prev_unk || !is_unk) {
  ------------------
  |  Branch (1297:13): [True: 4.55M, False: 911k]
  |  Branch (1297:29): [True: 911k, False: 0]
  ------------------
 1298|  5.46M|          if constexpr (std::is_same_v<T, int>) {
 1299|  5.46M|            output->emplace_back(id);
 1300|       |          } else {
 1301|       |            if (is_unk && has_unk_piece) {
 1302|       |              output->emplace_back(model_->unk_piece());
 1303|       |            } else {
 1304|       |              output->emplace_back(w.data(), w.size());
 1305|       |            }
 1306|       |          }
 1307|  5.46M|        } else {
 1308|       |          if constexpr (!std::is_same_v<T, int>) {
 1309|       |            if (!has_unk_piece) {
 1310|       |              output->back().append(w.data(), w.size());
 1311|       |            }
 1312|       |          }
 1313|      0|        }
 1314|  5.46M|      }
 1315|  21.0M|      is_prev_unk = is_unk;
 1316|  21.0M|    }
 1317|  21.0M|  }
 1318|       |
 1319|  1.42k|  return ApplyExtraOptions(encode_extra_options_, output);
 1320|  1.42k|}
_ZNK13sentencepiece22SentencePieceProcessor17ApplyExtraOptionsINSt3__16vectorIiNS2_9allocatorIiEEEEEEN4absl12lts_202608176StatusENS8_4SpanIKNS0_11ExtraOptionEEEPT_:
 1118|  1.42k|    absl::Span<const ExtraOption> extra_options, T* output) const {
 1119|  1.42k|  for (const auto& extra_option : extra_options) {
  ------------------
  |  Branch (1119:33): [True: 0, False: 1.42k]
  ------------------
 1120|      0|    switch (extra_option) {
 1121|      0|      case REVERSE:
  ------------------
  |  Branch (1121:7): [True: 0, False: 0]
  ------------------
 1122|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1123|       |          std::reverse(output->mutable_pieces()->begin(),
 1124|       |                       output->mutable_pieces()->end());
 1125|      0|        } else {
 1126|      0|          std::reverse(output->begin(), output->end());
 1127|      0|        }
 1128|      0|        break;
 1129|      0|      case EOS:
  ------------------
  |  Branch (1129:7): [True: 0, False: 0]
  ------------------
 1130|      0|        if (const int id = eos_id(); id != -1) {
  ------------------
  |  Branch (1130:38): [True: 0, False: 0]
  ------------------
 1131|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1132|       |            auto* piece = output->add_pieces();
 1133|       |            piece->set_id(id);
 1134|       |            piece->set_piece(model_->eos_piece().data(),
 1135|       |                             model_->eos_piece().size());
 1136|       |            piece->set_begin(output->text().size());
 1137|       |            piece->set_end(output->text().size());
 1138|      0|          } else {
 1139|      0|            using V = typename T::value_type;
 1140|      0|            if constexpr (std::is_same_v<V, int>) {
 1141|      0|              output->emplace_back(id);
 1142|       |            } else {
 1143|       |              output->emplace_back(model_->eos_piece());
 1144|       |            }
 1145|      0|          }
 1146|      0|        }
 1147|      0|        break;
 1148|      0|      case BOS:
  ------------------
  |  Branch (1148:7): [True: 0, False: 0]
  ------------------
 1149|      0|        if (const int id = bos_id(); id != -1) {
  ------------------
  |  Branch (1149:38): [True: 0, False: 0]
  ------------------
 1150|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1151|       |            auto* array = output->mutable_pieces();
 1152|       |            array->Add();
 1153|       |            for (int i = array->size() - 1; i > 0; --i) {
 1154|       |              array->SwapElements(i - 1, i);
 1155|       |            }
 1156|       |            auto* piece = array->Mutable(0);
 1157|       |            piece->set_id(id);
 1158|       |            piece->set_piece(model_->bos_piece().data(),
 1159|       |                             model_->bos_piece().size());
 1160|       |            piece->set_begin(0);
 1161|       |            piece->set_end(0);
 1162|      0|          } else {
 1163|      0|            using V = typename T::value_type;
 1164|      0|            if constexpr (std::is_same_v<V, int>) {
 1165|      0|              output->emplace(output->begin(), id);
 1166|       |            } else {
 1167|       |              output->emplace(output->begin(), model_->bos_piece());
 1168|       |            }
 1169|      0|          }
 1170|      0|        }
 1171|      0|        break;
 1172|      0|      case UNK_PIECE:
  ------------------
  |  Branch (1172:7): [True: 0, False: 0]
  ------------------
 1173|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1174|       |          for (int i = 0; i < output->pieces_size(); ++i) {
 1175|       |            auto* piece = output->mutable_pieces(i);
 1176|       |            if (IsUnknownId(*model_, unk_id_, piece->id())) {
 1177|       |              piece->set_piece(model_->unk_piece().data(),
 1178|       |                               model_->unk_piece().size());
 1179|       |            }
 1180|       |          }
 1181|       |        }
 1182|      0|        break;
 1183|      0|      default:
  ------------------
  |  Branch (1183:7): [True: 0, False: 0]
  ------------------
 1184|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1185|       |          output->Clear();
 1186|      0|        } else {
 1187|      0|          output->clear();
 1188|      0|        }
 1189|      0|        return absl::InternalError("unknown extra_option type.");
 1190|      0|    }
 1191|      0|  }
 1192|  1.42k|  return absl::OkStatus();
 1193|  1.42k|}
_ZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEEN4absl12lts_202608176StatusENS8_4SpanIKT_EEPNS2_12basic_stringIcS5_NS2_9allocatorIcEEEE:
 1324|  1.37k|    absl::Span<const T> input, std::string* detokenized) const {
 1325|  2.75k|  RET_CHECK_STATUS_STL(detokenized);
  ------------------
  |  |  182|  1.37k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.37k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  2.75k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  2.75k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  2.75k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.37k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.37k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.37k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  2.75k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.37k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  2.75k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  2.75k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.37k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  2.75k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  1.37k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.37k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.37k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.37k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.37k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  1.37k|  container->clear();
  ------------------
 1326|       |
 1327|  2.75k|  if (input.empty()) {
  ------------------
  |  Branch (1327:7): [True: 0, False: 1.37k]
  ------------------
 1328|      0|    return absl::OkStatus();
 1329|      0|  }
 1330|       |
 1331|       |  // active_input points to the data we will decode. By default it points to the
 1332|       |  // input span (zero-copy).
 1333|  1.37k|  absl::Span<const T> active_input = input;
 1334|       |  // If we have extra options to apply, we must copy the input to a mutable
 1335|       |  // container (work_input) to apply the modifications, as the input span is
 1336|       |  // const.
 1337|  1.37k|  std::vector<T> work_input;
 1338|       |
 1339|  1.37k|  if (!decode_extra_options_.empty()) {
  ------------------
  |  Branch (1339:7): [True: 0, False: 1.37k]
  ------------------
 1340|      0|    work_input.assign(input.begin(), input.end());
 1341|      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()
  |  |  ------------------
  ------------------
 1342|      0|    active_input = work_input;
 1343|      0|  }
 1344|       |
 1345|  1.37k|  absl::string_view unk_surface = kDefaultUnknownSymbol;
 1346|  1.37k|  if (model_proto_ && model_proto_->trainer_spec().has_unk_surface())
  ------------------
  |  Branch (1346:7): [True: 1.37k, False: 0]
  |  Branch (1346:23): [True: 0, False: 1.37k]
  ------------------
 1347|      0|    unk_surface = model_proto_->trainer_spec().unk_surface();
 1348|       |
 1349|  1.37k|  std::string byte_queue;
 1350|       |
 1351|  1.37k|  auto ProcessByteQueue = [&]() -> absl::Status {
 1352|  1.37k|    if (byte_queue.empty()) return absl::OkStatus();
 1353|  1.37k|    int offset = 0;
 1354|  1.37k|    const int bytes_len = byte_queue.size();
 1355|  1.37k|    while (offset < bytes_len) {
 1356|  1.37k|      size_t consumed;
 1357|  1.37k|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1358|  1.37k|          absl::string_view(byte_queue).substr(offset), &consumed);
 1359|  1.37k|      if (!is_valid) {
 1360|  1.37k|        RET_CHECK_EQ(consumed, 1);
 1361|  1.37k|        absl::StrAppend(detokenized, kReplacementCharacter);
 1362|  1.37k|      } else {
 1363|  1.37k|        const absl::string_view utf8 =
 1364|  1.37k|            absl::string_view(byte_queue).substr(offset, consumed);
 1365|  1.37k|        absl::StrAppend(detokenized, utf8);
 1366|  1.37k|      }
 1367|  1.37k|      offset += consumed;
 1368|  1.37k|    }
 1369|  1.37k|    byte_queue.clear();
 1370|  1.37k|    return absl::OkStatus();
 1371|  1.37k|  };
 1372|       |
 1373|  1.37k|  bool is_bos_ws = true;
 1374|  1.37k|  const int num_pieces = model_->GetPieceSize();
 1375|  44.2M|  for (const auto& item : active_input) {
  ------------------
  |  Branch (1375:25): [True: 44.2M, False: 1.37k]
  ------------------
 1376|  44.2M|    int id = -1;
 1377|  44.2M|    absl::string_view piece;
 1378|       |    if constexpr (std::is_same_v<T, int>) {
 1379|       |      id = item;
 1380|       |      if (id < 0 || id >= num_pieces) {
 1381|       |        return absl::Status(absl::StatusCode::kOutOfRange,
 1382|       |                            absl::StrCat("Invalid id: ", id));
 1383|       |      }
 1384|       |      piece = model_->IdToPiece(id);
 1385|  44.2M|    } else {
 1386|  44.2M|      piece = item;
 1387|  44.2M|      id = model_->PieceToId(piece);
 1388|  44.2M|    }
 1389|       |
 1390|  44.2M|    if (IsByteId(*model_, id)) {
  ------------------
  |  Branch (1390:9): [True: 36.4M, False: 7.71M]
  ------------------
 1391|  36.4M|      const int byte = PieceToByte(piece);
 1392|  36.4M|      RET_CHECK_LE(0, byte);
  ------------------
  |  |   31|  36.4M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  36.4M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 36.4M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  36.4M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  36.4M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
 1393|  36.4M|      byte_queue.append(1, byte);
 1394|  36.4M|    } else {
 1395|  7.71M|      ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  7.71M|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  15.4M|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  15.4M|  switch (0)                                           \
  |  |  |  |  |  |  350|  15.4M|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 7.71M, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  7.71M|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 7.71M]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  15.4M|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 7.71M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  15.4M|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  15.4M|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  7.71M|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  15.4M|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1396|  7.71M|      if (!detokenized->empty()) {
  ------------------
  |  Branch (1396:11): [True: 7.71M, False: 2.08k]
  ------------------
 1397|  7.71M|        is_bos_ws = false;
 1398|  7.71M|      }
 1399|       |
 1400|  7.71M|      if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1400:11): [True: 0, False: 7.71M]
  ------------------
 1401|      0|        continue;
 1402|      0|      }
 1403|       |
 1404|  7.71M|      absl::string_view p = piece;
 1405|  7.71M|      bool has_bos_ws = false;
 1406|  7.71M|      if (is_bos_ws &&
  ------------------
  |  Branch (1406:11): [True: 2.08k, False: 7.71M]
  ------------------
 1407|  2.08k|          (!model_proto_ ||
  ------------------
  |  Branch (1407:12): [True: 0, False: 2.08k]
  ------------------
 1408|  2.08k|           model_proto_->normalizer_spec().add_dummy_prefix() ||
  ------------------
  |  Branch (1408:12): [True: 2.08k, False: 0]
  ------------------
 1409|  2.08k|           model_proto_->normalizer_spec().remove_extra_whitespaces())) {
  ------------------
  |  Branch (1409:12): [True: 0, False: 0]
  ------------------
 1410|  2.08k|        has_bos_ws = absl::ConsumePrefix(&p, kSpaceSymbol);
 1411|  2.08k|        if (model_proto_ &&
  ------------------
  |  Branch (1411:13): [True: 2.08k, False: 0]
  ------------------
 1412|  2.08k|            model_proto_->normalizer_spec().remove_extra_whitespaces()) {
  ------------------
  |  Branch (1412:13): [True: 2.08k, False: 0]
  ------------------
 1413|  2.08k|          has_bos_ws = false;
 1414|  2.08k|        }
 1415|  2.08k|      }
 1416|       |
 1417|  7.71M|      if (IsUnknownId(*model_, unk_id_, id)) {
  ------------------
  |  Branch (1417:11): [True: 0, False: 7.71M]
  ------------------
 1418|      0|        if (id >= 0 && model_->IdToPiece(id) == piece) {
  ------------------
  |  Branch (1418:13): [True: 0, False: 0]
  |  Branch (1418:24): [True: 0, False: 0]
  ------------------
 1419|      0|          absl::StrAppend(detokenized, unk_surface);
 1420|      0|        } else {
 1421|      0|          absl::StrAppend(detokenized, piece);
 1422|      0|        }
 1423|  7.71M|      } else {
 1424|  7.71M|        absl::StrAppend(detokenized,
 1425|  7.71M|                        absl::StrReplaceAll(p, {{kSpaceSymbol, " "}}));
 1426|  7.71M|      }
 1427|       |
 1428|  7.71M|      if (has_bos_ws || !detokenized->empty()) {
  ------------------
  |  Branch (1428:11): [True: 0, False: 7.71M]
  |  Branch (1428:25): [True: 7.71M, False: 1.74k]
  ------------------
 1429|  7.71M|        is_bos_ws = false;
 1430|  7.71M|      }
 1431|  7.71M|    }
 1432|  44.2M|  }
 1433|  1.37k|  ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  1.37k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  4.13k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  2.75k|  switch (0)                                           \
  |  |  |  |  |  |  350|  2.75k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.37k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.37k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.37k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  4.13k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.37k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  4.13k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  4.13k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.37k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  4.13k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1434|       |
 1435|  1.37k|  if (denormalizer_) {
  ------------------
  |  Branch (1435:7): [True: 0, False: 1.37k]
  ------------------
 1436|      0|    *detokenized = denormalizer_->Normalize(*detokenized);
 1437|      0|  }
 1438|       |
 1439|  1.37k|  return absl::OkStatus();
 1440|  1.37k|}
_ZZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEEN4absl12lts_202608176StatusENS8_4SpanIKT_EEPNS2_12basic_stringIcS5_NS2_9allocatorIcEEEEENKUlvE_clEv:
 1351|  7.71M|  auto ProcessByteQueue = [&]() -> absl::Status {
 1352|  7.71M|    if (byte_queue.empty()) return absl::OkStatus();
  ------------------
  |  Branch (1352:9): [True: 5.97M, False: 1.74M]
  ------------------
 1353|  1.74M|    int offset = 0;
 1354|  1.74M|    const int bytes_len = byte_queue.size();
 1355|  23.9M|    while (offset < bytes_len) {
  ------------------
  |  Branch (1355:12): [True: 22.2M, False: 1.74M]
  ------------------
 1356|  22.2M|      size_t consumed;
 1357|  22.2M|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1358|  22.2M|          absl::string_view(byte_queue).substr(offset), &consumed);
 1359|  22.2M|      if (!is_valid) {
  ------------------
  |  Branch (1359:11): [True: 0, False: 22.2M]
  ------------------
 1360|      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 << "] "
  |  |  ------------------
  ------------------
 1361|      0|        absl::StrAppend(detokenized, kReplacementCharacter);
 1362|  22.2M|      } else {
 1363|  22.2M|        const absl::string_view utf8 =
 1364|  22.2M|            absl::string_view(byte_queue).substr(offset, consumed);
 1365|  22.2M|        absl::StrAppend(detokenized, utf8);
 1366|  22.2M|      }
 1367|  22.2M|      offset += consumed;
 1368|  22.2M|    }
 1369|  1.74M|    byte_queue.clear();
 1370|  1.74M|    return absl::OkStatus();
 1371|  1.74M|  };
_ZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedIiEEN4absl12lts_202608176StatusENS3_4SpanIKT_EEPNSt3__112basic_stringIcNS9_11char_traitsIcEENS9_9allocatorIcEEEE:
 1324|  1.40k|    absl::Span<const T> input, std::string* detokenized) const {
 1325|  2.80k|  RET_CHECK_STATUS_STL(detokenized);
  ------------------
  |  |  182|  1.40k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.40k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  2.80k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  2.80k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  2.80k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.40k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.40k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.40k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  2.80k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.40k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  2.80k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  2.80k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.40k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  2.80k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  183|  1.40k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.40k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.40k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.40k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.40k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  184|  1.40k|  container->clear();
  ------------------
 1326|       |
 1327|  2.80k|  if (input.empty()) {
  ------------------
  |  Branch (1327:7): [True: 0, False: 1.40k]
  ------------------
 1328|      0|    return absl::OkStatus();
 1329|      0|  }
 1330|       |
 1331|       |  // active_input points to the data we will decode. By default it points to the
 1332|       |  // input span (zero-copy).
 1333|  1.40k|  absl::Span<const T> active_input = input;
 1334|       |  // If we have extra options to apply, we must copy the input to a mutable
 1335|       |  // container (work_input) to apply the modifications, as the input span is
 1336|       |  // const.
 1337|  1.40k|  std::vector<T> work_input;
 1338|       |
 1339|  1.40k|  if (!decode_extra_options_.empty()) {
  ------------------
  |  Branch (1339:7): [True: 0, False: 1.40k]
  ------------------
 1340|      0|    work_input.assign(input.begin(), input.end());
 1341|      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()
  |  |  ------------------
  ------------------
 1342|      0|    active_input = work_input;
 1343|      0|  }
 1344|       |
 1345|  1.40k|  absl::string_view unk_surface = kDefaultUnknownSymbol;
 1346|  1.40k|  if (model_proto_ && model_proto_->trainer_spec().has_unk_surface())
  ------------------
  |  Branch (1346:7): [True: 1.40k, False: 0]
  |  Branch (1346:23): [True: 0, False: 1.40k]
  ------------------
 1347|      0|    unk_surface = model_proto_->trainer_spec().unk_surface();
 1348|       |
 1349|  1.40k|  std::string byte_queue;
 1350|       |
 1351|  1.40k|  auto ProcessByteQueue = [&]() -> absl::Status {
 1352|  1.40k|    if (byte_queue.empty()) return absl::OkStatus();
 1353|  1.40k|    int offset = 0;
 1354|  1.40k|    const int bytes_len = byte_queue.size();
 1355|  1.40k|    while (offset < bytes_len) {
 1356|  1.40k|      size_t consumed;
 1357|  1.40k|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1358|  1.40k|          absl::string_view(byte_queue).substr(offset), &consumed);
 1359|  1.40k|      if (!is_valid) {
 1360|  1.40k|        RET_CHECK_EQ(consumed, 1);
 1361|  1.40k|        absl::StrAppend(detokenized, kReplacementCharacter);
 1362|  1.40k|      } else {
 1363|  1.40k|        const absl::string_view utf8 =
 1364|  1.40k|            absl::string_view(byte_queue).substr(offset, consumed);
 1365|  1.40k|        absl::StrAppend(detokenized, utf8);
 1366|  1.40k|      }
 1367|  1.40k|      offset += consumed;
 1368|  1.40k|    }
 1369|  1.40k|    byte_queue.clear();
 1370|  1.40k|    return absl::OkStatus();
 1371|  1.40k|  };
 1372|       |
 1373|  1.40k|  bool is_bos_ws = true;
 1374|  1.40k|  const int num_pieces = model_->GetPieceSize();
 1375|  32.7M|  for (const auto& item : active_input) {
  ------------------
  |  Branch (1375:25): [True: 32.7M, False: 1.40k]
  ------------------
 1376|  32.7M|    int id = -1;
 1377|  32.7M|    absl::string_view piece;
 1378|  32.7M|    if constexpr (std::is_same_v<T, int>) {
 1379|  32.7M|      id = item;
 1380|  32.7M|      if (id < 0 || id >= num_pieces) {
  ------------------
  |  Branch (1380:11): [True: 0, False: 32.7M]
  |  Branch (1380:21): [True: 0, False: 32.7M]
  ------------------
 1381|      0|        return absl::Status(absl::StatusCode::kOutOfRange,
 1382|      0|                            absl::StrCat("Invalid id: ", id));
 1383|      0|      }
 1384|  32.7M|      piece = model_->IdToPiece(id);
 1385|       |    } else {
 1386|       |      piece = item;
 1387|       |      id = model_->PieceToId(piece);
 1388|       |    }
 1389|       |
 1390|  32.7M|    if (IsByteId(*model_, id)) {
  ------------------
  |  Branch (1390:9): [True: 27.2M, False: 5.46M]
  ------------------
 1391|  27.2M|      const int byte = PieceToByte(piece);
 1392|  27.2M|      RET_CHECK_LE(0, byte);
  ------------------
  |  |   31|  27.2M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  27.2M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 27.2M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  27.2M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  27.2M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
 1393|  27.2M|      byte_queue.append(1, byte);
 1394|  27.2M|    } else {
 1395|  5.46M|      ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  5.46M|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  10.9M|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  10.9M|  switch (0)                                           \
  |  |  |  |  |  |  350|  10.9M|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 5.46M, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  5.46M|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 5.46M]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  10.9M|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 5.46M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  10.9M|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  10.9M|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  5.46M|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  10.9M|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1396|  5.46M|      if (!detokenized->empty()) {
  ------------------
  |  Branch (1396:11): [True: 5.46M, False: 2.17k]
  ------------------
 1397|  5.46M|        is_bos_ws = false;
 1398|  5.46M|      }
 1399|       |
 1400|  5.46M|      if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1400:11): [True: 0, False: 5.46M]
  ------------------
 1401|      0|        continue;
 1402|      0|      }
 1403|       |
 1404|  5.46M|      absl::string_view p = piece;
 1405|  5.46M|      bool has_bos_ws = false;
 1406|  5.46M|      if (is_bos_ws &&
  ------------------
  |  Branch (1406:11): [True: 2.17k, False: 5.46M]
  ------------------
 1407|  2.17k|          (!model_proto_ ||
  ------------------
  |  Branch (1407:12): [True: 0, False: 2.17k]
  ------------------
 1408|  2.17k|           model_proto_->normalizer_spec().add_dummy_prefix() ||
  ------------------
  |  Branch (1408:12): [True: 2.17k, False: 0]
  ------------------
 1409|  2.17k|           model_proto_->normalizer_spec().remove_extra_whitespaces())) {
  ------------------
  |  Branch (1409:12): [True: 0, False: 0]
  ------------------
 1410|  2.17k|        has_bos_ws = absl::ConsumePrefix(&p, kSpaceSymbol);
 1411|  2.17k|        if (model_proto_ &&
  ------------------
  |  Branch (1411:13): [True: 2.17k, False: 0]
  ------------------
 1412|  2.17k|            model_proto_->normalizer_spec().remove_extra_whitespaces()) {
  ------------------
  |  Branch (1412:13): [True: 2.17k, False: 0]
  ------------------
 1413|  2.17k|          has_bos_ws = false;
 1414|  2.17k|        }
 1415|  2.17k|      }
 1416|       |
 1417|  5.46M|      if (IsUnknownId(*model_, unk_id_, id)) {
  ------------------
  |  Branch (1417:11): [True: 0, False: 5.46M]
  ------------------
 1418|      0|        if (id >= 0 && model_->IdToPiece(id) == piece) {
  ------------------
  |  Branch (1418:13): [True: 0, False: 0]
  |  Branch (1418:24): [True: 0, False: 0]
  ------------------
 1419|      0|          absl::StrAppend(detokenized, unk_surface);
 1420|      0|        } else {
 1421|      0|          absl::StrAppend(detokenized, piece);
 1422|      0|        }
 1423|  5.46M|      } else {
 1424|  5.46M|        absl::StrAppend(detokenized,
 1425|  5.46M|                        absl::StrReplaceAll(p, {{kSpaceSymbol, " "}}));
 1426|  5.46M|      }
 1427|       |
 1428|  5.46M|      if (has_bos_ws || !detokenized->empty()) {
  ------------------
  |  Branch (1428:11): [True: 0, False: 5.46M]
  |  Branch (1428:25): [True: 5.46M, False: 1.83k]
  ------------------
 1429|  5.46M|        is_bos_ws = false;
 1430|  5.46M|      }
 1431|  5.46M|    }
 1432|  32.7M|  }
 1433|  1.40k|  ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  1.40k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  4.20k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  2.80k|  switch (0)                                           \
  |  |  |  |  |  |  350|  2.80k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.40k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.40k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.40k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  4.20k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.40k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  4.20k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  4.20k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.40k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  4.20k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1434|       |
 1435|  1.40k|  if (denormalizer_) {
  ------------------
  |  Branch (1435:7): [True: 0, False: 1.40k]
  ------------------
 1436|      0|    *detokenized = denormalizer_->Normalize(*detokenized);
 1437|      0|  }
 1438|       |
 1439|  1.40k|  return absl::OkStatus();
 1440|  1.40k|}
_ZZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedIiEEN4absl12lts_202608176StatusENS3_4SpanIKT_EEPNSt3__112basic_stringIcNS9_11char_traitsIcEENS9_9allocatorIcEEEEENKUlvE_clEv:
 1351|  5.46M|  auto ProcessByteQueue = [&]() -> absl::Status {
 1352|  5.46M|    if (byte_queue.empty()) return absl::OkStatus();
  ------------------
  |  Branch (1352:9): [True: 4.55M, False: 912k]
  ------------------
 1353|   912k|    int offset = 0;
 1354|   912k|    const int bytes_len = byte_queue.size();
 1355|  16.5M|    while (offset < bytes_len) {
  ------------------
  |  Branch (1355:12): [True: 15.6M, False: 912k]
  ------------------
 1356|  15.6M|      size_t consumed;
 1357|  15.6M|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1358|  15.6M|          absl::string_view(byte_queue).substr(offset), &consumed);
 1359|  15.6M|      if (!is_valid) {
  ------------------
  |  Branch (1359:11): [True: 0, False: 15.6M]
  ------------------
 1360|      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 << "] "
  |  |  ------------------
  ------------------
 1361|      0|        absl::StrAppend(detokenized, kReplacementCharacter);
 1362|  15.6M|      } else {
 1363|  15.6M|        const absl::string_view utf8 =
 1364|  15.6M|            absl::string_view(byte_queue).substr(offset, consumed);
 1365|  15.6M|        absl::StrAppend(detokenized, utf8);
 1366|  15.6M|      }
 1367|  15.6M|      offset += consumed;
 1368|  15.6M|    }
 1369|   912k|    byte_queue.clear();
 1370|   912k|    return absl::OkStatus();
 1371|   912k|  };
_ZNK13sentencepiece22SentencePieceProcessor17ApplyExtraOptionsINS_17SentencePieceTextEEEN4absl12lts_202608176StatusENS4_4SpanIKNS0_11ExtraOptionEEEPT_:
 1118|  12.8k|    absl::Span<const ExtraOption> extra_options, T* output) const {
 1119|  12.8k|  for (const auto& extra_option : extra_options) {
  ------------------
  |  Branch (1119:33): [True: 0, False: 12.8k]
  ------------------
 1120|      0|    switch (extra_option) {
 1121|      0|      case REVERSE:
  ------------------
  |  Branch (1121:7): [True: 0, False: 0]
  ------------------
 1122|      0|        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1123|      0|          std::reverse(output->mutable_pieces()->begin(),
 1124|      0|                       output->mutable_pieces()->end());
 1125|       |        } else {
 1126|       |          std::reverse(output->begin(), output->end());
 1127|       |        }
 1128|      0|        break;
 1129|      0|      case EOS:
  ------------------
  |  Branch (1129:7): [True: 0, False: 0]
  ------------------
 1130|      0|        if (const int id = eos_id(); id != -1) {
  ------------------
  |  Branch (1130:38): [True: 0, False: 0]
  ------------------
 1131|      0|          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1132|      0|            auto* piece = output->add_pieces();
 1133|      0|            piece->set_id(id);
 1134|      0|            piece->set_piece(model_->eos_piece().data(),
 1135|      0|                             model_->eos_piece().size());
 1136|      0|            piece->set_begin(output->text().size());
 1137|      0|            piece->set_end(output->text().size());
 1138|       |          } else {
 1139|       |            using V = typename T::value_type;
 1140|       |            if constexpr (std::is_same_v<V, int>) {
 1141|       |              output->emplace_back(id);
 1142|       |            } else {
 1143|       |              output->emplace_back(model_->eos_piece());
 1144|       |            }
 1145|       |          }
 1146|      0|        }
 1147|      0|        break;
 1148|      0|      case BOS:
  ------------------
  |  Branch (1148:7): [True: 0, False: 0]
  ------------------
 1149|      0|        if (const int id = bos_id(); id != -1) {
  ------------------
  |  Branch (1149:38): [True: 0, False: 0]
  ------------------
 1150|      0|          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1151|      0|            auto* array = output->mutable_pieces();
 1152|      0|            array->Add();
 1153|      0|            for (int i = array->size() - 1; i > 0; --i) {
  ------------------
  |  Branch (1153:45): [True: 0, False: 0]
  ------------------
 1154|      0|              array->SwapElements(i - 1, i);
 1155|      0|            }
 1156|      0|            auto* piece = array->Mutable(0);
 1157|      0|            piece->set_id(id);
 1158|      0|            piece->set_piece(model_->bos_piece().data(),
 1159|      0|                             model_->bos_piece().size());
 1160|      0|            piece->set_begin(0);
 1161|      0|            piece->set_end(0);
 1162|       |          } else {
 1163|       |            using V = typename T::value_type;
 1164|       |            if constexpr (std::is_same_v<V, int>) {
 1165|       |              output->emplace(output->begin(), id);
 1166|       |            } else {
 1167|       |              output->emplace(output->begin(), model_->bos_piece());
 1168|       |            }
 1169|       |          }
 1170|      0|        }
 1171|      0|        break;
 1172|      0|      case UNK_PIECE:
  ------------------
  |  Branch (1172:7): [True: 0, False: 0]
  ------------------
 1173|      0|        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1174|      0|          for (int i = 0; i < output->pieces_size(); ++i) {
  ------------------
  |  Branch (1174:27): [True: 0, False: 0]
  ------------------
 1175|      0|            auto* piece = output->mutable_pieces(i);
 1176|      0|            if (IsUnknownId(*model_, unk_id_, piece->id())) {
  ------------------
  |  Branch (1176:17): [True: 0, False: 0]
  ------------------
 1177|      0|              piece->set_piece(model_->unk_piece().data(),
 1178|      0|                               model_->unk_piece().size());
 1179|      0|            }
 1180|      0|          }
 1181|      0|        }
 1182|      0|        break;
 1183|      0|      default:
  ------------------
  |  Branch (1183:7): [True: 0, False: 0]
  ------------------
 1184|      0|        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1185|      0|          output->Clear();
 1186|       |        } else {
 1187|       |          output->clear();
 1188|       |        }
 1189|      0|        return absl::InternalError("unknown extra_option type.");
 1190|      0|    }
 1191|      0|  }
 1192|  12.8k|  return absl::OkStatus();
 1193|  12.8k|}

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

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

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

_ZN13sentencepiece22GetRandomGeneratorSeedEv:
   54|      1|uint32_t GetRandomGeneratorSeed() { return g_seed.load(); }
_ZN13sentencepiece15GetNBestTimeoutEv:
   80|  4.65k|int GetNBestTimeout() { return g_nbest_timeout_ms.load(); }
_ZN13sentencepiece11string_util10DecodeUTF8EPKcS2_Pm:
   85|   236M|char32_t DecodeUTF8(const char* begin, const char* end, size_t* mblen) {
   86|   236M|  const size_t len = end - begin;
   87|       |
   88|   236M|  if (static_cast<unsigned char>(begin[0]) < 0x80) {
  ------------------
  |  Branch (88:7): [True: 176M, False: 60.4M]
  ------------------
   89|   176M|    *mblen = 1;
   90|   176M|    return static_cast<unsigned char>(begin[0]);
   91|   176M|  } else if (len >= 2 && (begin[0] & 0xE0) == 0xC0) {
  ------------------
  |  Branch (91:14): [True: 60.4M, False: 6.62k]
  |  Branch (91:26): [True: 9.53M, False: 50.9M]
  ------------------
   92|  9.53M|    const char32_t cp = (((begin[0] & 0x1F) << 6) | ((begin[1] & 0x3F)));
   93|  9.53M|    if (IsTrailByte(begin[1]) && cp >= 0x0080 && IsValidCodepoint(cp)) {
  ------------------
  |  Branch (93:9): [True: 1.41M, False: 8.11M]
  |  Branch (93:34): [True: 1.35M, False: 59.6k]
  |  Branch (93:50): [True: 1.35M, False: 0]
  ------------------
   94|  1.35M|      *mblen = 2;
   95|  1.35M|      return cp;
   96|  1.35M|    }
   97|  50.9M|  } else if (len >= 3 && (begin[0] & 0xF0) == 0xE0) {
  ------------------
  |  Branch (97:14): [True: 50.8M, False: 12.2k]
  |  Branch (97:26): [True: 21.3M, False: 29.5M]
  ------------------
   98|  21.3M|    const char32_t cp = (((begin[0] & 0x0F) << 12) | ((begin[1] & 0x3F) << 6) |
   99|  21.3M|                         ((begin[2] & 0x3F)));
  100|  21.3M|    if (IsTrailByte(begin[1]) && IsTrailByte(begin[2]) && cp >= 0x0800 &&
  ------------------
  |  Branch (100:9): [True: 13.2M, False: 8.11M]
  |  Branch (100:34): [True: 12.9M, False: 300k]
  |  Branch (100:59): [True: 12.9M, False: 2.17k]
  ------------------
  101|  12.9M|        IsValidCodepoint(cp)) {
  ------------------
  |  Branch (101:9): [True: 12.9M, False: 4.10k]
  ------------------
  102|  12.9M|      *mblen = 3;
  103|  12.9M|      return cp;
  104|  12.9M|    }
  105|  29.5M|  } else if (len >= 4 && (begin[0] & 0xf8) == 0xF0) {
  ------------------
  |  Branch (105:14): [True: 29.5M, False: 17.3k]
  |  Branch (105:26): [True: 1.36M, False: 28.1M]
  ------------------
  106|  1.36M|    const char32_t cp = (((begin[0] & 0x07) << 18) | ((begin[1] & 0x3F) << 12) |
  107|  1.36M|                         ((begin[2] & 0x3F) << 6) | ((begin[3] & 0x3F)));
  108|  1.36M|    if (IsTrailByte(begin[1]) && IsTrailByte(begin[2]) &&
  ------------------
  |  Branch (108:9): [True: 314k, False: 1.04M]
  |  Branch (108:34): [True: 110k, False: 204k]
  ------------------
  109|   110k|        IsTrailByte(begin[3]) && cp >= 0x10000 && IsValidCodepoint(cp)) {
  ------------------
  |  Branch (109:9): [True: 67.2k, False: 42.9k]
  |  Branch (109:34): [True: 66.4k, False: 857]
  |  Branch (109:51): [True: 59.8k, False: 6.60k]
  ------------------
  110|  59.8k|      *mblen = 4;
  111|  59.8k|      return cp;
  112|  59.8k|    }
  113|  1.36M|  }
  114|       |
  115|       |  // Invalid UTF-8.
  116|  46.0M|  *mblen = 1;
  117|  46.0M|  return kUnicodeError;
  118|   236M|}
_ZN13sentencepiece6random18GetRandomGeneratorEv:
  221|  4.50k|absl::BitGen* GetRandomGenerator() {
  222|       |  // Thread-locals occupy stack space in every thread ever created by the
  223|       |  // program, even if that thread never uses the thread-local variable.
  224|  4.50k|  thread_local static auto mt =
  225|  4.50k|      GetRandomGeneratorSeed() == kDefaultSeed
  ------------------
  |  Branch (225:7): [True: 1, False: 4.49k]
  ------------------
  226|  4.50k|          ? std::make_unique<absl::BitGen>()
  227|  4.50k|          : std::make_unique<absl::BitGen>(
  228|  4.49k|                std::seed_seq{GetRandomGeneratorSeed()});
  229|  4.50k|  return mt.get();
  230|  4.50k|}
_ZN13sentencepiece10log_domain6LogSumERKNSt3__16vectorIdNS1_9allocatorIdEEEE:
  379|    738|double LogSum(const std::vector<double>& xs) {
  380|    738|  if (xs.empty()) {
  ------------------
  |  Branch (380:7): [True: 0, False: 738]
  ------------------
  381|      0|    return -1.0 * std::numeric_limits<double>::max();
  382|      0|  }
  383|    738|  double sum = xs.front();
  384|       |
  385|    738|  auto log_add = [](double xa, double xb) {
  386|    738|    if (xa > xb) {
  387|    738|      std::swap(xa, xb);
  388|    738|    }
  389|    738|    return xb + std::log1p(std::exp(xa - xb));
  390|    738|  };
  391|  2.34k|  for (size_t i = 1; i < xs.size(); ++i) {
  ------------------
  |  Branch (391:22): [True: 1.60k, False: 738]
  ------------------
  392|  1.60k|    sum = log_add(sum, xs[i]);
  393|  1.60k|  }
  394|    738|  return sum;
  395|    738|}
util.cc:_ZZN13sentencepiece10log_domain6LogSumERKNSt3__16vectorIdNS1_9allocatorIdEEEEENK3$_0clEdd:
  385|  1.60k|  auto log_add = [](double xa, double xb) {
  386|  1.60k|    if (xa > xb) {
  ------------------
  |  Branch (386:9): [True: 1.60k, False: 0]
  ------------------
  387|  1.60k|      std::swap(xa, xb);
  388|  1.60k|    }
  389|  1.60k|    return xb + std::log1p(std::exp(xa - xb));
  390|  1.60k|  };

_ZN13sentencepiece11string_util17IsValidDecodeUTF8ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPm:
  135|   236M|inline bool IsValidDecodeUTF8(absl::string_view input, size_t* mblen) {
  136|   236M|  const char32_t c = DecodeUTF8(input, mblen);
  137|   236M|  return c != kUnicodeError || *mblen == 3;
  ------------------
  |  Branch (137:10): [True: 178M, False: 58.8M]
  |  Branch (137:32): [True: 12.7M, False: 46.0M]
  ------------------
  138|   236M|}
_ZN13sentencepiece11string_util10DecodeUTF8ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPm:
  131|   236M|inline char32_t DecodeUTF8(absl::string_view input, size_t* mblen) {
  132|   236M|  return DecodeUTF8(input.data(), input.data() + input.size(), mblen);
  133|   236M|}
_ZN13sentencepiece11string_util10OneCharLenEPKc:
   83|   327M|inline size_t OneCharLen(const char* src) {
   84|   327M|  return "\1\1\1\1\1\1\1\1\1\1\1\1\2\2\3\4"[(*src & 0xFF) >> 4];
   85|   327M|}
_ZN13sentencepiece11string_util11IsTrailByteEc:
  110|  45.9M|inline bool IsTrailByte(char x) { return static_cast<signed char>(x) < -0x40; }
_ZN13sentencepiece11string_util16IsValidCodepointEDi:
  121|  14.3M|inline bool IsValidCodepoint(char32_t c) {
  122|  14.3M|  return (static_cast<uint32_t>(c) < 0xD800) || (c >= 0xE000 && c <= 0x10FFFF);
  ------------------
  |  Branch (122:10): [True: 1.54M, False: 12.8M]
  |  Branch (122:50): [True: 12.8M, False: 4.10k]
  |  Branch (122:65): [True: 12.8M, False: 6.60k]
  ------------------
  123|  14.3M|}

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