2012-07-18 18:59:03 +00:00
|
|
|
#pragma once
|
2006-11-30 20:13:59 +00:00
|
|
|
|
2006-12-05 01:31:45 +00:00
|
|
|
namespace nix {
|
|
|
|
|
|
|
|
|
2007-09-18 09:11:20 +00:00
|
|
|
#define WORKER_MAGIC_1 0x6e697863
|
|
|
|
#define WORKER_MAGIC_2 0x6478696f
|
|
|
|
|
2020-09-17 17:27:11 +00:00
|
|
|
#define PROTOCOL_VERSION 0x119
|
2007-09-18 09:11:20 +00:00
|
|
|
#define GET_PROTOCOL_MAJOR(x) ((x) & 0xff00)
|
2007-11-16 16:15:26 +00:00
|
|
|
#define GET_PROTOCOL_MINOR(x) ((x) & 0x00ff)
|
2006-11-30 20:13:59 +00:00
|
|
|
|
|
|
|
|
|
|
|
typedef enum {
|
2008-06-18 09:34:17 +00:00
|
|
|
wopIsValidPath = 1,
|
2007-08-13 11:15:13 +00:00
|
|
|
wopHasSubstitutes = 3,
|
2016-04-19 16:50:15 +00:00
|
|
|
wopQueryPathHash = 4, // obsolete
|
|
|
|
wopQueryReferences = 5, // obsolete
|
2008-06-18 09:34:17 +00:00
|
|
|
wopQueryReferrers = 6,
|
|
|
|
wopAddToStore = 7,
|
2020-09-17 18:19:15 +00:00
|
|
|
wopAddTextToStore = 8, // obsolete since 1.25, Nix 3.0. Use wopAddToStore
|
2012-06-27 20:58:15 +00:00
|
|
|
wopBuildPaths = 9,
|
2008-06-18 09:34:17 +00:00
|
|
|
wopEnsurePath = 10,
|
|
|
|
wopAddTempRoot = 11,
|
|
|
|
wopAddIndirectRoot = 12,
|
|
|
|
wopSyncWithGC = 13,
|
|
|
|
wopFindRoots = 14,
|
2016-05-04 11:36:54 +00:00
|
|
|
wopExportPath = 16, // obsolete
|
2016-04-19 16:50:15 +00:00
|
|
|
wopQueryDeriver = 18, // obsolete
|
2008-06-18 09:34:17 +00:00
|
|
|
wopSetOptions = 19,
|
|
|
|
wopCollectGarbage = 20,
|
2008-08-04 11:44:50 +00:00
|
|
|
wopQuerySubstitutablePathInfo = 21,
|
2020-06-10 09:20:52 +00:00
|
|
|
wopQueryDerivationOutputs = 22, // obsolete
|
2012-07-11 14:49:04 +00:00
|
|
|
wopQueryAllValidPaths = 23,
|
2010-05-04 10:45:10 +00:00
|
|
|
wopQueryFailedPaths = 24,
|
|
|
|
wopClearFailedPaths = 25,
|
2010-11-17 12:08:01 +00:00
|
|
|
wopQueryPathInfo = 26,
|
2016-05-04 11:36:54 +00:00
|
|
|
wopImportPaths = 27, // obsolete
|
2020-06-12 10:46:33 +00:00
|
|
|
wopQueryDerivationOutputNames = 28, // obsolete
|
2012-07-17 22:55:39 +00:00
|
|
|
wopQueryPathFromHashPart = 29,
|
2012-07-18 14:47:59 +00:00
|
|
|
wopQuerySubstitutablePathInfos = 30,
|
|
|
|
wopQueryValidPaths = 31,
|
|
|
|
wopQuerySubstitutablePaths = 32,
|
2012-12-20 17:41:44 +00:00
|
|
|
wopQueryValidDerivers = 33,
|
2015-06-01 21:20:11 +00:00
|
|
|
wopOptimiseStore = 34,
|
2015-09-03 10:56:59 +00:00
|
|
|
wopVerifyStore = 35,
|
|
|
|
wopBuildDerivation = 36,
|
2016-04-05 13:30:22 +00:00
|
|
|
wopAddSignatures = 37,
|
2016-09-02 18:33:58 +00:00
|
|
|
wopNarFromPath = 38,
|
2017-04-06 16:40:19 +00:00
|
|
|
wopAddToStoreNar = 39,
|
|
|
|
wopQueryMissing = 40,
|
2020-06-10 09:20:52 +00:00
|
|
|
wopQueryDerivationOutputMap = 41,
|
2006-11-30 20:13:59 +00:00
|
|
|
} WorkerOp;
|
|
|
|
|
|
|
|
|
2006-12-03 02:08:13 +00:00
|
|
|
#define STDERR_NEXT 0x6f6c6d67
|
2007-02-21 17:34:02 +00:00
|
|
|
#define STDERR_READ 0x64617461 // data needed from source
|
|
|
|
#define STDERR_WRITE 0x64617416 // data for sink
|
2006-12-03 02:08:13 +00:00
|
|
|
#define STDERR_LAST 0x616c7473
|
|
|
|
#define STDERR_ERROR 0x63787470
|
2017-08-28 16:49:42 +00:00
|
|
|
#define STDERR_START_ACTIVITY 0x53545254
|
|
|
|
#define STDERR_STOP_ACTIVITY 0x53544f50
|
|
|
|
#define STDERR_RESULT 0x52534c54
|
2006-12-03 02:08:13 +00:00
|
|
|
|
|
|
|
|
2018-09-24 11:53:44 +00:00
|
|
|
class Store;
|
2019-10-30 19:38:02 +00:00
|
|
|
struct Source;
|
2018-09-24 11:53:44 +00:00
|
|
|
|
2020-09-30 00:39:06 +00:00
|
|
|
/* To guide overloading */
|
2020-07-24 21:02:51 +00:00
|
|
|
template<typename T>
|
2020-09-30 00:39:06 +00:00
|
|
|
struct Phantom {};
|
|
|
|
|
|
|
|
|
|
|
|
namespace worker_proto {
|
|
|
|
/* FIXME maybe move more stuff inside here */
|
|
|
|
|
|
|
|
#define MAKE_WORKER_PROTO(TEMPLATE, T) \
|
|
|
|
TEMPLATE T read(const Store & store, Source & from, Phantom< T > _); \
|
|
|
|
TEMPLATE void write(const Store & store, Sink & out, const T & str)
|
|
|
|
|
|
|
|
MAKE_WORKER_PROTO(, std::string);
|
|
|
|
MAKE_WORKER_PROTO(, StorePath);
|
|
|
|
MAKE_WORKER_PROTO(, ContentAddress);
|
|
|
|
|
|
|
|
MAKE_WORKER_PROTO(template<typename T>, std::set<T>);
|
|
|
|
MAKE_WORKER_PROTO(template<typename T>, std::optional<T>);
|
2020-08-06 22:04:13 +00:00
|
|
|
|
2020-09-30 00:39:06 +00:00
|
|
|
#define X_ template<typename K, typename V>
|
|
|
|
#define Y_ std::map<K, V>
|
|
|
|
MAKE_WORKER_PROTO(X_, Y_);
|
|
|
|
#undef X_
|
|
|
|
#undef Y_
|
2020-07-24 21:02:51 +00:00
|
|
|
|
|
|
|
template<typename T>
|
2020-09-30 00:39:06 +00:00
|
|
|
std::set<T> read(const Store & store, Source & from, Phantom<std::set<T>> _)
|
|
|
|
{
|
|
|
|
std::set<T> resSet;
|
|
|
|
auto size = readNum<size_t>(from);
|
|
|
|
while (size--) {
|
|
|
|
resSet.insert(read(store, from, Phantom<T> {}));
|
2020-07-24 21:02:51 +00:00
|
|
|
}
|
2020-09-30 00:39:06 +00:00
|
|
|
return resSet;
|
|
|
|
}
|
2020-07-24 21:02:51 +00:00
|
|
|
|
2020-09-30 00:39:06 +00:00
|
|
|
template<typename T>
|
|
|
|
void write(const Store & store, Sink & out, const std::set<T> & resSet)
|
|
|
|
{
|
|
|
|
out << resSet.size();
|
|
|
|
for (auto & key : resSet) {
|
|
|
|
write(store, out, key);
|
2020-08-04 19:02:05 +00:00
|
|
|
}
|
2020-09-30 00:39:06 +00:00
|
|
|
}
|
2020-08-04 19:02:05 +00:00
|
|
|
|
|
|
|
template<typename K, typename V>
|
2020-09-30 00:39:06 +00:00
|
|
|
std::map<K, V> read(const Store & store, Source & from, Phantom<std::map<K, V>> _)
|
|
|
|
{
|
|
|
|
std::map<K, V> resMap;
|
|
|
|
auto size = readNum<size_t>(from);
|
|
|
|
while (size--) {
|
|
|
|
auto k = read(store, from, Phantom<K> {});
|
|
|
|
auto v = read(store, from, Phantom<V> {});
|
|
|
|
resMap.insert_or_assign(std::move(k), std::move(v));
|
2020-07-24 21:02:51 +00:00
|
|
|
}
|
2020-09-30 00:39:06 +00:00
|
|
|
return resMap;
|
|
|
|
}
|
2020-07-24 21:02:51 +00:00
|
|
|
|
2020-09-30 00:39:06 +00:00
|
|
|
template<typename K, typename V>
|
|
|
|
void write(const Store & store, Sink & out, const std::map<K, V> & resMap)
|
|
|
|
{
|
|
|
|
out << resMap.size();
|
|
|
|
for (auto & i : resMap) {
|
|
|
|
write(store, out, i.first);
|
|
|
|
write(store, out, i.second);
|
2020-07-24 21:02:51 +00:00
|
|
|
}
|
2020-09-30 00:39:06 +00:00
|
|
|
}
|
2020-07-24 21:02:51 +00:00
|
|
|
|
2020-08-06 22:04:13 +00:00
|
|
|
template<typename T>
|
2020-09-30 00:39:06 +00:00
|
|
|
std::optional<T> read(const Store & store, Source & from, Phantom<std::optional<T>> _)
|
|
|
|
{
|
|
|
|
auto tag = readNum<uint8_t>(from);
|
|
|
|
switch (tag) {
|
|
|
|
case 0:
|
|
|
|
return std::nullopt;
|
|
|
|
case 1:
|
|
|
|
return read(store, from, Phantom<T> {});
|
|
|
|
default:
|
|
|
|
throw Error("got an invalid tag bit for std::optional: %#04x", (size_t)tag);
|
2020-08-06 22:04:13 +00:00
|
|
|
}
|
2020-09-30 00:39:06 +00:00
|
|
|
}
|
2020-06-19 22:06:19 +00:00
|
|
|
|
2020-09-30 00:39:06 +00:00
|
|
|
template<typename T>
|
|
|
|
void write(const Store & store, Sink & out, const std::optional<T> & optVal)
|
|
|
|
{
|
|
|
|
out << (uint64_t) (optVal ? 1 : 0);
|
|
|
|
if (optVal)
|
|
|
|
nix::worker_proto::write(store, out, *optVal);
|
|
|
|
}
|
2012-07-30 21:13:25 +00:00
|
|
|
|
2020-08-07 18:51:01 +00:00
|
|
|
/* Specialization which uses and empty string for the empty case, taking
|
|
|
|
advantage of the fact these types always serialize to non-empty strings.
|
|
|
|
This is done primarily for backwards compatability, so that T <=
|
|
|
|
std::optional<T>, where <= is the compatability partial order, T is one of
|
|
|
|
the types below.
|
|
|
|
*/
|
2020-09-30 00:39:06 +00:00
|
|
|
MAKE_WORKER_PROTO(, std::optional<StorePath>);
|
|
|
|
MAKE_WORKER_PROTO(, std::optional<ContentAddress>);
|
|
|
|
|
|
|
|
}
|
2020-06-19 22:06:19 +00:00
|
|
|
|
2006-12-05 01:31:45 +00:00
|
|
|
}
|