b66234134f
Similar to the nar-info disk cache (and using the same db). This makes rebuilds muuch faster. - This works regardless of the ca-derivations experimental feature. I could modify the logic to not touch the db if the flag isn’t there, but given that this is a trash-able local cache, it doesn’t seem to be really worth it. - We could unify the `NARs` and `Realisation` tables to only have one generic kv table. This is left as an exercise to the reader. - I didn’t update the cache db version number as the new schema just adds a new table to the previous one, so the db will be transparently migrated and is backwards-compatible. Fix #4746
49 lines
1.3 KiB
C++
49 lines
1.3 KiB
C++
#pragma once
|
|
|
|
#include "ref.hh"
|
|
#include "nar-info.hh"
|
|
#include "realisation.hh"
|
|
|
|
namespace nix {
|
|
|
|
class NarInfoDiskCache
|
|
{
|
|
public:
|
|
typedef enum { oValid, oInvalid, oUnknown } Outcome;
|
|
|
|
virtual ~NarInfoDiskCache() { }
|
|
|
|
virtual void createCache(const std::string & uri, const Path & storeDir,
|
|
bool wantMassQuery, int priority) = 0;
|
|
|
|
struct CacheInfo
|
|
{
|
|
bool wantMassQuery;
|
|
int priority;
|
|
};
|
|
|
|
virtual std::optional<CacheInfo> cacheExists(const std::string & uri) = 0;
|
|
|
|
virtual std::pair<Outcome, std::shared_ptr<NarInfo>> lookupNarInfo(
|
|
const std::string & uri, const std::string & hashPart) = 0;
|
|
|
|
virtual void upsertNarInfo(
|
|
const std::string & uri, const std::string & hashPart,
|
|
std::shared_ptr<const ValidPathInfo> info) = 0;
|
|
|
|
virtual void upsertRealisation(
|
|
const std::string & uri,
|
|
const Realisation & realisation) = 0;
|
|
virtual void upsertAbsentRealisation(
|
|
const std::string & uri,
|
|
const DrvOutput & id) = 0;
|
|
virtual std::pair<Outcome, std::shared_ptr<Realisation>> lookupRealisation(
|
|
const std::string & uri, const DrvOutput & id) = 0;
|
|
};
|
|
|
|
/* Return a singleton cache object that can be used concurrently by
|
|
multiple threads. */
|
|
ref<NarInfoDiskCache> getNarInfoDiskCache();
|
|
|
|
}
|