mirror of
https://github.com/revng/revng
synced 2026-06-21 14:07:57 +00:00
Giacomo Vercesi
7f7f9571a8
Add infrastructure to pypeline that allows containers to be notified when they are being used last, this allows two things: * `Pipe`s eagerly clearing those containers once they are done reading their contents * `ScheduledTask`s clearing those out at the end of their execution in case the pipe did not do it This overall should improve memory usage as container no longer take up memory if they are no longer used as part of a `Schedule`.
67 lines
1.7 KiB
C++
67 lines
1.7 KiB
C++
#pragma once
|
|
|
|
//
|
|
// This file is distributed under the MIT License. See LICENSE.md for details.
|
|
//
|
|
|
|
#include "revng/PipeboxCommon/Common.h"
|
|
#include "revng/PipeboxCommon/ObjectID.h"
|
|
|
|
namespace revng::pypeline {
|
|
|
|
template<TupleTreeCompatible T, Kind TheKind, ConstexprString TheName>
|
|
class TupleTreeContainer {
|
|
public:
|
|
static constexpr llvm::StringRef Name = TheName;
|
|
static constexpr Kind Kind = TheKind;
|
|
static constexpr llvm::StringRef MimeType = "text/x.yaml";
|
|
|
|
private:
|
|
bool Disposable = false;
|
|
std::map<ObjectID, TupleTree<T>> Map;
|
|
|
|
public:
|
|
std::set<ObjectID> objects() const {
|
|
return std::views::keys(Map) | revng::to<std::set<ObjectID>>();
|
|
}
|
|
|
|
void
|
|
deserialize(const std::map<const ObjectID *, llvm::ArrayRef<char>> Data) {
|
|
for (const auto &[Key, Value] : Data) {
|
|
revng_assert(Key->kind() == Kind);
|
|
llvm::StringRef String{ Value.data(), Value.size() };
|
|
Map[*Key] = llvm::cantFail(TupleTree<T>::fromString(String));
|
|
}
|
|
}
|
|
|
|
std::map<ObjectID, Buffer>
|
|
serialize(const std::vector<const ObjectID *> Objects) const {
|
|
std::map<ObjectID, Buffer> Result;
|
|
for (const ObjectID *Object : Objects) {
|
|
llvm::raw_svector_ostream OS(Result[*Object].data());
|
|
Map.at(*Object).serialize(OS);
|
|
}
|
|
return Result;
|
|
}
|
|
|
|
bool verify() const { return true; }
|
|
|
|
void setIsDisposable() { Disposable = true; }
|
|
|
|
void disposeIfPossible() {
|
|
if (not Disposable)
|
|
return;
|
|
Map.clear();
|
|
Disposable = false;
|
|
}
|
|
|
|
public:
|
|
bool contains(const ObjectID &Key) const { return Map.contains(Key); }
|
|
TupleTree<T> &getElement(const ObjectID &Key) { return Map[Key]; }
|
|
const TupleTree<T> &getElement(const ObjectID &Key) const {
|
|
return Map.at(Key);
|
|
}
|
|
};
|
|
|
|
} // namespace revng::pypeline
|