Co-authored-by: eldritch horrors <pennae@lix.systems>
Co-authored-by: Sergei Zimmerman <sergei@zimmerman.foo>
See original commit on lix:
f5754dc90a
148 lines
4.0 KiB
C++
148 lines
4.0 KiB
C++
#pragma once
|
|
///@file
|
|
|
|
#include "nix/expr/print.hh"
|
|
#include "nix/expr/eval.hh"
|
|
#include "nix/expr/eval-error.hh"
|
|
#include "nix/expr/eval-settings.hh"
|
|
|
|
namespace nix {
|
|
|
|
/**
|
|
* Note: Various places expect the allocated memory to be zeroed.
|
|
*/
|
|
[[gnu::always_inline]]
|
|
inline void * allocBytes(size_t n)
|
|
{
|
|
void * p;
|
|
#if NIX_USE_BOEHMGC
|
|
p = GC_MALLOC(n);
|
|
#else
|
|
p = calloc(n, 1);
|
|
#endif
|
|
if (!p)
|
|
throw std::bad_alloc();
|
|
return p;
|
|
}
|
|
|
|
[[gnu::always_inline]]
|
|
Value * EvalMemory::allocValue()
|
|
{
|
|
#if NIX_USE_BOEHMGC
|
|
/* We use the boehm batch allocator to speed up allocations of Values (of which there are many).
|
|
GC_malloc_many returns a linked list of objects of the given size, where the first word
|
|
of each object is also the pointer to the next object in the list. This also means that we
|
|
have to explicitly clear the first word of every object we take. */
|
|
if (!*valueAllocCache) {
|
|
*valueAllocCache = GC_malloc_many(sizeof(Value));
|
|
if (!*valueAllocCache)
|
|
throw std::bad_alloc();
|
|
}
|
|
|
|
/* GC_NEXT is a convenience macro for accessing the first word of an object.
|
|
Take the first list item, advance the list to the next item, and clear the next pointer. */
|
|
void * p = *valueAllocCache;
|
|
*valueAllocCache = GC_NEXT(p);
|
|
GC_NEXT(p) = nullptr;
|
|
#else
|
|
void * p = allocBytes(sizeof(Value));
|
|
#endif
|
|
|
|
stats.nrValues++;
|
|
return (Value *) p;
|
|
}
|
|
|
|
[[gnu::always_inline]]
|
|
Env & EvalMemory::allocEnv(size_t size)
|
|
{
|
|
stats.nrEnvs++;
|
|
stats.nrValuesInEnvs += size;
|
|
|
|
Env * env;
|
|
|
|
#if NIX_USE_BOEHMGC
|
|
if (size == 1) {
|
|
/* see allocValue for explanations. */
|
|
if (!*env1AllocCache) {
|
|
*env1AllocCache = GC_malloc_many(sizeof(Env) + sizeof(Value *));
|
|
if (!*env1AllocCache)
|
|
throw std::bad_alloc();
|
|
}
|
|
|
|
void * p = *env1AllocCache;
|
|
*env1AllocCache = GC_NEXT(p);
|
|
GC_NEXT(p) = nullptr;
|
|
env = (Env *) p;
|
|
} else
|
|
#endif
|
|
env = (Env *) allocBytes(sizeof(Env) + size * sizeof(Value *));
|
|
|
|
/* We assume that env->values has been cleared by the allocator; maybeThunk() and lookupVar fromWith expect this. */
|
|
|
|
return *env;
|
|
}
|
|
|
|
[[gnu::always_inline]]
|
|
void EvalState::forceValue(Value & v, const PosIdx pos)
|
|
{
|
|
if (v.isThunk()) {
|
|
Env * env = v.thunk().env;
|
|
assert(env || v.isBlackhole());
|
|
Expr * expr = v.thunk().expr;
|
|
try {
|
|
v.mkBlackhole();
|
|
// checkInterrupt();
|
|
if (env) [[likely]]
|
|
expr->eval(*this, *env, v);
|
|
else
|
|
ExprBlackHole::throwInfiniteRecursionError(*this, v);
|
|
} catch (...) {
|
|
v.mkThunk(env, expr);
|
|
tryFixupBlackHolePos(v, pos);
|
|
throw;
|
|
}
|
|
} else if (v.isApp())
|
|
callFunction(*v.app().left, *v.app().right, v, pos);
|
|
}
|
|
|
|
[[gnu::always_inline]]
|
|
inline void EvalState::forceAttrs(Value & v, const PosIdx pos, std::string_view errorCtx)
|
|
{
|
|
forceAttrs(v, [&]() { return pos; }, errorCtx);
|
|
}
|
|
|
|
template<typename Callable>
|
|
[[gnu::always_inline]]
|
|
inline void EvalState::forceAttrs(Value & v, Callable getPos, std::string_view errorCtx)
|
|
{
|
|
PosIdx pos = getPos();
|
|
forceValue(v, pos);
|
|
if (v.type() != nAttrs) {
|
|
error<TypeError>("expected a set but found %1%: %2%", showType(v), ValuePrinter(*this, v, errorPrintOptions))
|
|
.withTrace(pos, errorCtx)
|
|
.debugThrow();
|
|
}
|
|
}
|
|
|
|
[[gnu::always_inline]]
|
|
inline void EvalState::forceList(Value & v, const PosIdx pos, std::string_view errorCtx)
|
|
{
|
|
forceValue(v, pos);
|
|
if (!v.isList()) {
|
|
error<TypeError>("expected a list but found %1%: %2%", showType(v), ValuePrinter(*this, v, errorPrintOptions))
|
|
.withTrace(pos, errorCtx)
|
|
.debugThrow();
|
|
}
|
|
}
|
|
|
|
[[gnu::always_inline]]
|
|
inline CallDepth EvalState::addCallDepth(const PosIdx pos)
|
|
{
|
|
if (callDepth > settings.maxCallDepth)
|
|
error<EvalBaseError>("stack overflow; max-call-depth exceeded").atPos(pos).debugThrow();
|
|
|
|
return CallDepth(callDepth);
|
|
};
|
|
|
|
} // namespace nix
|