mirror of
https://github.com/revng/revng
synced 2026-06-21 14:07:57 +00:00
Alessandro Di Federico
974dd0c680
This change introduces some duplication but ensures an important property of `tuple_tree_generate`d: data structures: all the leaves are scalars. Previously, yield::Function was using efa::BasicBlock, making things more difficult under certain conditions. Specifically, we can rely on the fact that, when generating a visit to the TupleTree, we know everything about all non-scalars.
29 lines
547 B
C++
29 lines
547 B
C++
/// \file Dump.cpp
|
|
/// \brief
|
|
|
|
//
|
|
// This file is distributed under the MIT License. See LICENSE.md for details.
|
|
//
|
|
|
|
#include "revng/Yield/BasicBlock.h"
|
|
#include "revng/Yield/CallEdge.h"
|
|
#include "revng/Yield/Function.h"
|
|
#include "revng/Yield/Instruction.h"
|
|
#include "revng/Yield/Tag.h"
|
|
|
|
void yield::Tag::dump() const {
|
|
serialize(dbg, *this);
|
|
}
|
|
|
|
void yield::Instruction::dump() const {
|
|
serialize(dbg, *this);
|
|
}
|
|
|
|
void yield::BasicBlock::dump() const {
|
|
serialize(dbg, *this);
|
|
}
|
|
|
|
void yield::Function::dump() const {
|
|
serialize(dbg, *this);
|
|
}
|