mirror of
https://github.com/RGBCube/serenity
synced 2025-10-31 03:22:43 +00:00
952441943f
This algorithm is both iterative and recursive, so allocating on every recursion, or when iterating each child is extremely costly. Instead allow the on stack DIE to be re-initialized so it can be reused.
50 lines
1.3 KiB
C++
50 lines
1.3 KiB
C++
/*
|
|
* Copyright (c) 2020-2021, Itamar S. <itamar8910@gmail.com>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "AttributeValue.h"
|
|
#include "DwarfTypes.h"
|
|
#include <AK/Function.h>
|
|
#include <AK/NonnullOwnPtr.h>
|
|
#include <AK/Optional.h>
|
|
#include <AK/Types.h>
|
|
|
|
namespace Debug::Dwarf {
|
|
|
|
class CompilationUnit;
|
|
|
|
// DIE = Debugging Information Entry
|
|
class DIE {
|
|
public:
|
|
DIE(CompilationUnit const&, u32 offset, Optional<u32> parent_offset = {});
|
|
|
|
u32 offset() const { return m_offset; }
|
|
u32 size() const { return m_size; }
|
|
bool has_children() const { return m_has_children; }
|
|
EntryTag tag() const { return m_tag; }
|
|
|
|
Optional<AttributeValue> get_attribute(Attribute const&) const;
|
|
|
|
void for_each_child(Function<void(DIE const& child)> callback) const;
|
|
|
|
bool is_null() const { return m_tag == EntryTag::None; }
|
|
CompilationUnit const& compilation_unit() const { return m_compilation_unit; }
|
|
Optional<u32> parent_offset() const { return m_parent_offset; }
|
|
|
|
private:
|
|
void rehydrate_from(u32 offset, Optional<u32> parent_offset);
|
|
CompilationUnit const& m_compilation_unit;
|
|
u32 m_offset { 0 };
|
|
u32 m_data_offset { 0 };
|
|
size_t m_abbreviation_code { 0 };
|
|
EntryTag m_tag { EntryTag::None };
|
|
bool m_has_children { false };
|
|
u32 m_size { 0 };
|
|
Optional<u32> m_parent_offset;
|
|
};
|
|
|
|
}
|