2020-06-01 21:32:27 +00:00
|
|
|
|
#pragma once
|
|
|
|
|
|
2020-06-01 22:53:31 +00:00
|
|
|
|
#include <variant>
|
2020-06-01 21:32:27 +00:00
|
|
|
|
#include "hash.hh"
|
2020-10-07 13:52:20 +00:00
|
|
|
|
#include "path.hh"
|
2022-03-25 22:40:40 +00:00
|
|
|
|
#include "comparator.hh"
|
2020-06-01 21:32:27 +00:00
|
|
|
|
|
|
|
|
|
namespace nix {
|
|
|
|
|
|
2020-10-07 13:52:20 +00:00
|
|
|
|
/*
|
2020-10-13 03:30:14 +00:00
|
|
|
|
* Content addressing method
|
2020-10-07 13:52:20 +00:00
|
|
|
|
*/
|
|
|
|
|
|
2022-04-19 22:25:21 +00:00
|
|
|
|
/* We only have one way to hash text with references, so this is a single-value
|
|
|
|
|
type, mainly useful with std::variant.
|
|
|
|
|
*/
|
|
|
|
|
struct TextHashMethod : std::monostate { };
|
|
|
|
|
|
2020-06-01 21:32:27 +00:00
|
|
|
|
enum struct FileIngestionMethod : uint8_t {
|
|
|
|
|
Flat = false,
|
|
|
|
|
Recursive = true
|
|
|
|
|
};
|
|
|
|
|
|
2020-10-13 03:30:14 +00:00
|
|
|
|
struct FixedOutputHashMethod {
|
|
|
|
|
FileIngestionMethod fileIngestionMethod;
|
|
|
|
|
HashType hashType;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Compute the prefix to the hash algorithm which indicates how the files were
|
|
|
|
|
ingested. */
|
2022-04-19 22:25:21 +00:00
|
|
|
|
std::string makeFileIngestionPrefix(FileIngestionMethod m);
|
2020-10-13 03:30:14 +00:00
|
|
|
|
|
|
|
|
|
|
2022-04-19 22:25:21 +00:00
|
|
|
|
/* Just the type of a content address. Combine with the hash itself, and we
|
|
|
|
|
have a `ContentAddress` as defined below. Combine that, in turn, with info
|
|
|
|
|
on references, and we have `ContentAddressWithReferences`, as defined
|
|
|
|
|
further below. */
|
2020-10-13 03:30:14 +00:00
|
|
|
|
typedef std::variant<
|
|
|
|
|
TextHashMethod,
|
|
|
|
|
FixedOutputHashMethod
|
2023-01-06 16:18:14 +00:00
|
|
|
|
> ContentAddressMethod;
|
2020-10-13 03:30:14 +00:00
|
|
|
|
|
|
|
|
|
ContentAddressMethod parseContentAddressMethod(std::string_view rawCaMethod);
|
|
|
|
|
|
|
|
|
|
std::string renderContentAddressMethod(ContentAddressMethod caMethod);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Mini content address
|
|
|
|
|
*/
|
2020-10-07 13:52:20 +00:00
|
|
|
|
|
2020-06-01 23:26:40 +00:00
|
|
|
|
struct TextHash {
|
|
|
|
|
Hash hash;
|
2022-03-25 22:40:40 +00:00
|
|
|
|
|
|
|
|
|
GENERATE_CMP(TextHash, me->hash);
|
2020-06-01 23:26:40 +00:00
|
|
|
|
};
|
|
|
|
|
|
2020-06-01 21:32:27 +00:00
|
|
|
|
/// Pair of a hash, and how the file system was ingested
|
2020-06-19 15:18:19 +00:00
|
|
|
|
struct FixedOutputHash {
|
2020-06-01 21:32:27 +00:00
|
|
|
|
FileIngestionMethod method;
|
|
|
|
|
Hash hash;
|
|
|
|
|
std::string printMethodAlgo() const;
|
2022-03-25 22:40:40 +00:00
|
|
|
|
|
|
|
|
|
GENERATE_CMP(FixedOutputHash, me->method, me->hash);
|
2020-06-01 21:32:27 +00:00
|
|
|
|
};
|
|
|
|
|
|
2020-06-01 22:53:31 +00:00
|
|
|
|
/*
|
|
|
|
|
We've accumulated several types of content-addressed paths over the years;
|
|
|
|
|
fixed-output derivations support multiple hash algorithms and serialisation
|
|
|
|
|
methods (flat file vs NAR). Thus, ‘ca’ has one of the following forms:
|
|
|
|
|
|
|
|
|
|
* ‘text:sha256:<sha256 hash of file contents>’: For paths
|
|
|
|
|
computed by makeTextPath() / addTextToStore().
|
|
|
|
|
|
|
|
|
|
* ‘fixed:<r?>:<ht>:<h>’: For paths computed by
|
|
|
|
|
makeFixedOutputPath() / addToStore().
|
|
|
|
|
*/
|
|
|
|
|
typedef std::variant<
|
2020-06-01 23:26:40 +00:00
|
|
|
|
TextHash, // for paths computed by makeTextPath() / addTextToStore
|
2020-06-19 15:18:19 +00:00
|
|
|
|
FixedOutputHash // for path computed by makeFixedOutputPath
|
2020-06-01 22:53:31 +00:00
|
|
|
|
> ContentAddress;
|
|
|
|
|
|
2020-06-01 23:26:40 +00:00
|
|
|
|
std::string renderContentAddress(ContentAddress ca);
|
|
|
|
|
|
|
|
|
|
std::string renderContentAddress(std::optional<ContentAddress> ca);
|
|
|
|
|
|
2020-06-02 15:00:10 +00:00
|
|
|
|
ContentAddress parseContentAddress(std::string_view rawCa);
|
2020-06-02 00:37:43 +00:00
|
|
|
|
|
2020-06-02 15:00:10 +00:00
|
|
|
|
std::optional<ContentAddress> parseContentAddressOpt(std::string_view rawCaOpt);
|
2020-06-02 00:37:43 +00:00
|
|
|
|
|
2020-07-10 11:21:37 +00:00
|
|
|
|
Hash getContentAddressHash(const ContentAddress & ca);
|
|
|
|
|
|
2022-04-19 22:25:21 +00:00
|
|
|
|
|
2020-10-07 13:52:20 +00:00
|
|
|
|
/*
|
|
|
|
|
* References set
|
|
|
|
|
*/
|
|
|
|
|
|
2023-01-14 21:38:43 +00:00
|
|
|
|
struct StoreReferences {
|
|
|
|
|
StorePathSet others;
|
|
|
|
|
bool self = false;
|
|
|
|
|
|
|
|
|
|
bool empty() const;
|
|
|
|
|
size_t size() const;
|
|
|
|
|
|
|
|
|
|
GENERATE_CMP(StoreReferences, me->self, me->others);
|
|
|
|
|
};
|
2020-10-07 13:52:20 +00:00
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Full content address
|
|
|
|
|
*
|
|
|
|
|
* See the schema for store paths in store-api.cc
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
// This matches the additional info that we need for makeTextPath
|
|
|
|
|
struct TextInfo : TextHash {
|
|
|
|
|
// References for the paths, self references disallowed
|
|
|
|
|
StorePathSet references;
|
2022-03-25 22:40:40 +00:00
|
|
|
|
|
|
|
|
|
GENERATE_CMP(TextInfo, *(const TextHash *)me, me->references);
|
2020-10-07 13:52:20 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
struct FixedOutputInfo : FixedOutputHash {
|
|
|
|
|
// References for the paths
|
2023-01-06 20:36:05 +00:00
|
|
|
|
StoreReferences references;
|
2022-03-25 22:40:40 +00:00
|
|
|
|
|
|
|
|
|
GENERATE_CMP(FixedOutputInfo, *(const FixedOutputHash *)me, me->references);
|
2020-10-07 13:52:20 +00:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
typedef std::variant<
|
|
|
|
|
TextInfo,
|
|
|
|
|
FixedOutputInfo
|
|
|
|
|
> ContentAddressWithReferences;
|
|
|
|
|
|
|
|
|
|
ContentAddressWithReferences caWithoutRefs(const ContentAddress &);
|
|
|
|
|
|
2020-06-01 21:32:27 +00:00
|
|
|
|
}
|