mirror of
https://github.com/nodejs/node.git
synced 2026-11-09 15:11:11 -05:00
Daniel Lemire
2e9e844d99
PR-URL: https://github.com/nodejs/node/pull/58028 Reviewed-By: Yagiz Nizipli <yagiz@nizipli.com> Reviewed-By: Tobias Nießen <tniessen@tnie.de> Reviewed-By: Vladimir Morozov <vmorozov@microsoft.com> Reviewed-By: Darshan Sen <raisinten@gmail.com> Reviewed-By: Marco Ippolito <marcoippolito54@gmail.com> Reviewed-By: James M Snell <jasnell@gmail.com> Reviewed-By: Rafael Gonzaga <rafael.nunu@hotmail.com> Reviewed-By: Shelley Vohr <shelley.vohr@gmail.com> Reviewed-By: Trivikram Kamat <trivikr.dev@gmail.com>
53 lines
1.6 KiB
C++
53 lines
1.6 KiB
C++
#include "cleanup_queue.h" // NOLINT(build/include_inline)
|
|
#include <algorithm>
|
|
#include <vector>
|
|
#include "cleanup_queue-inl.h"
|
|
|
|
namespace node {
|
|
|
|
std::vector<CleanupQueue::CleanupHookCallback> CleanupQueue::GetOrdered()
|
|
const {
|
|
// Copy into a vector, since we can't sort an unordered_set in-place.
|
|
std::vector<CleanupHookCallback> callbacks(cleanup_hooks_.begin(),
|
|
cleanup_hooks_.end());
|
|
// We can't erase the copied elements from `cleanup_hooks_` yet, because we
|
|
// need to be able to check whether they were un-scheduled by another hook.
|
|
|
|
std::ranges::sort(
|
|
callbacks,
|
|
[](const CleanupHookCallback& a, const CleanupHookCallback& b) {
|
|
// Sort in descending order so that the most recently inserted
|
|
// callbacks are run first.
|
|
return a.insertion_order_counter_ > b.insertion_order_counter_;
|
|
});
|
|
|
|
return callbacks;
|
|
}
|
|
|
|
void CleanupQueue::Drain() {
|
|
std::vector<CleanupHookCallback> callbacks = GetOrdered();
|
|
|
|
for (const CleanupHookCallback& cb : callbacks) {
|
|
if (cleanup_hooks_.count(cb) == 0) {
|
|
// This hook was removed from the `cleanup_hooks_` set during another
|
|
// hook that was run earlier. Nothing to do here.
|
|
continue;
|
|
}
|
|
|
|
cb.fn_(cb.arg_);
|
|
cleanup_hooks_.erase(cb);
|
|
}
|
|
}
|
|
|
|
size_t CleanupQueue::CleanupHookCallback::Hash::operator()(
|
|
const CleanupHookCallback& cb) const {
|
|
return std::hash<void*>()(cb.arg_);
|
|
}
|
|
|
|
bool CleanupQueue::CleanupHookCallback::Equal::operator()(
|
|
const CleanupHookCallback& a, const CleanupHookCallback& b) const {
|
|
return a.fn_ == b.fn_ && a.arg_ == b.arg_;
|
|
}
|
|
|
|
} // namespace node
|