LLDB mainline
LibStdcppTuple.cpp
Go to the documentation of this file.
1//===-- LibStdcppTuple.cpp ------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#include "LibStdcpp.h"
10
15
16#include <memory>
17#include <vector>
18
19using namespace lldb;
20using namespace lldb_private;
21using namespace lldb_private::formatters;
22
23namespace {
24
25class LibStdcppTupleSyntheticFrontEnd : public SyntheticChildrenFrontEnd {
26public:
27 explicit LibStdcppTupleSyntheticFrontEnd(lldb::ValueObjectSP valobj_sp);
28
29 llvm::Expected<uint32_t> CalculateNumChildren() override;
30
31 lldb::ValueObjectSP GetChildAtIndex(uint32_t idx) override;
32
33 lldb::ChildCacheState Update() override;
34
35private:
36 // The lifetime of a ValueObject and all its derivative ValueObjects
37 // (children, clones, etc.) is managed by a ClusterManager. These
38 // objects are only destroyed when every shared pointer to any of them
39 // is destroyed, so we must not store a shared pointer to any ValueObject
40 // derived from our backend ValueObject (since we're in the same cluster).
41 std::vector<ValueObject*> m_members;
42};
43
44} // end of anonymous namespace
45
46LibStdcppTupleSyntheticFrontEnd::LibStdcppTupleSyntheticFrontEnd(
47 lldb::ValueObjectSP valobj_sp)
48 : SyntheticChildrenFrontEnd(*valobj_sp) {
49 Update();
50}
51
52lldb::ChildCacheState LibStdcppTupleSyntheticFrontEnd::Update() {
53 m_members.clear();
54
55 ValueObjectSP valobj_backend_sp = m_backend.GetSP();
56 if (!valobj_backend_sp)
58
59 ValueObjectSP next_child_sp = valobj_backend_sp->GetNonSyntheticValue();
60 while (next_child_sp != nullptr) {
61 ValueObjectSP current_child = next_child_sp;
62 next_child_sp = nullptr;
63
64 size_t child_count = current_child->GetNumChildrenIgnoringErrors();
65 for (size_t i = 0; i < child_count; ++i) {
66 ValueObjectSP child_sp = current_child->GetChildAtIndex(i);
67 if (!child_sp)
68 continue;
69 llvm::StringRef name_str = child_sp->GetName().GetStringRef();
70 if (name_str.starts_with("std::_Tuple_impl<")) {
71 next_child_sp = child_sp;
72 } else if (name_str.starts_with("std::_Head_base<")) {
73 ValueObjectSP value_sp =
74 child_sp->GetChildMemberWithName("_M_head_impl");
75 if (value_sp) {
76 StreamString name;
77 name.Printf("[%zd]", m_members.size());
78 m_members.push_back(value_sp->Clone(ConstString(name.GetString())).get());
79 }
80 }
81 }
82 }
83
85}
86
88LibStdcppTupleSyntheticFrontEnd::GetChildAtIndex(uint32_t idx) {
89 if (idx < m_members.size() && m_members[idx])
90 return m_members[idx]->GetSP();
91 return lldb::ValueObjectSP();
92}
93
94llvm::Expected<uint32_t>
95LibStdcppTupleSyntheticFrontEnd::CalculateNumChildren() {
96 return m_members.size();
97}
98
99SyntheticChildrenFrontEnd *
101 CXXSyntheticChildren *, lldb::ValueObjectSP valobj_sp) {
102 return (valobj_sp ? new LibStdcppTupleSyntheticFrontEnd(valobj_sp) : nullptr);
103}
static std::optional< size_t > CalculateNumChildren(CompilerType container_elem_type, uint64_t num_elements, CompilerType element_type)
Calculates the number of elements stored in a container (with element type 'container_elem_type') as ...
llvm::StringRef GetString() const
size_t Printf(const char *format,...) __attribute__((format(printf
Output printf formatted output to the stream.
Definition Stream.cpp:134
SyntheticChildrenFrontEnd * LibStdcppTupleSyntheticFrontEndCreator(CXXSyntheticChildren *, lldb::ValueObjectSP)
A class that represents a running process on the host machine.
ChildCacheState
Specifies if children need to be re-computed after a call to SyntheticChildrenFrontEnd::Update.
@ eRefetch
Children need to be recomputed dynamically.
std::shared_ptr< lldb_private::ValueObject > ValueObjectSP