da898be8f9
Make special structure for old_disk_key. std::optional<std::string> was 40B, which is the largest member of out action union. Replaced with 8B, structure. This makes largest member now vertex_edge at 24B, this means Delta is now only 56B. 🥳🎉 Now less than a cacheline 🎊✨
43 lines
1.3 KiB
C++
43 lines
1.3 KiB
C++
// Copyright 2024 Memgraph Ltd.
|
|
//
|
|
// Use of this software is governed by the Business Source License
|
|
// included in the file licenses/BSL.txt; by using this file, you agree to be bound by the terms of the Business Source
|
|
// License, and you may not use this file except in compliance with the Business Source License.
|
|
//
|
|
// As of the Change Date specified in that file, in accordance with
|
|
// the Business Source License, use of this software will be governed
|
|
// by the Apache License, Version 2.0, included in the file
|
|
// licenses/APL.txt.
|
|
|
|
#pragma once
|
|
|
|
#include "storage/v2/delta.hpp"
|
|
#include "utils/skip_list.hpp"
|
|
|
|
namespace memgraph::utils {
|
|
|
|
inline std::optional<std::string> GetOldDiskKeyOrNull(storage::Delta *head) {
|
|
while (head->next != nullptr) {
|
|
head = head->next;
|
|
}
|
|
if (head->action == storage::Delta::Action::DELETE_DESERIALIZED_OBJECT) {
|
|
return head->old_disk_key.value.as_opt_str();
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
template <typename TSkipListAccessor>
|
|
inline bool ObjectExistsInCache(TSkipListAccessor &accessor, storage::Gid gid) {
|
|
return accessor.find(gid) != accessor.end();
|
|
}
|
|
|
|
inline uint64_t GetEarliestTimestamp(storage::Delta *head) {
|
|
if (head == nullptr) return 0;
|
|
while (head->next != nullptr) {
|
|
head = head->next;
|
|
}
|
|
return head->timestamp->load(std::memory_order_acquire);
|
|
}
|
|
|
|
} // namespace memgraph::utils
|