mirror of
https://github.com/revng/revng
synced 2026-06-21 14:07:57 +00:00
Massimo Fioravanti
c276a439b5
Replace the stub implementation of invalidation with the proper implementation. A ReadPathCache is added to each global so that it can keep tracks of what target are associated to which read paths.
49 lines
1.1 KiB
C++
49 lines
1.1 KiB
C++
#pragma once
|
|
|
|
//
|
|
// This file is distributed under the MIT License. See LICENSE.md for details.
|
|
//
|
|
|
|
#include <cstdint>
|
|
|
|
#include "revng/Support/Assert.h"
|
|
|
|
namespace revng {
|
|
|
|
///
|
|
/// A AccessCounter is optimized std::stack<bool> that can contain up to 8
|
|
/// elements.
|
|
///
|
|
class AccessTracker {
|
|
private:
|
|
std::uint8_t Counter = 0;
|
|
bool IsTracking;
|
|
|
|
public:
|
|
AccessTracker(bool StartsActive) { IsTracking = StartsActive; }
|
|
|
|
public:
|
|
bool operator==(const AccessTracker &Other) const = default;
|
|
|
|
bool operator!=(const AccessTracker &Other) const = default;
|
|
|
|
public:
|
|
void clear() {
|
|
Counter &= ~0x1;
|
|
IsTracking = true;
|
|
}
|
|
void access() { Counter |= (0x1 & IsTracking); }
|
|
void push() {
|
|
revng_assert(llvm::countLeadingZeros(Counter) != 0,
|
|
"More than 8 pushes have been performed");
|
|
Counter = Counter << 1;
|
|
}
|
|
void pop() { Counter = Counter >> 1; }
|
|
bool front() const { return (Counter & 0x1) == 0; }
|
|
bool peak() const { return Counter & 0x1; }
|
|
bool isSet() const { return Counter; }
|
|
void stopTracking() { IsTracking = false; }
|
|
};
|
|
|
|
} // namespace revng
|