forked from lix-project/lix
b70d22baca
Move clearValue inside Value mkInt instead of setInt mkBool instead of setBool mkString instead of setString mkPath instead of setPath mkNull instead of setNull mkAttrs instead of setAttrs mkList instead of setList* mkThunk instead of setThunk mkApp instead of setApp mkLambda instead of setLambda mkBlackhole instead of setBlackhole mkPrimOp instead of setPrimOp mkPrimOpApp instead of setPrimOpApp mkExternal instead of setExternal mkFloat instead of setFloat Add note that the static mk* function should be removed eventually
100 lines
2.1 KiB
C++
100 lines
2.1 KiB
C++
#pragma once
|
|
|
|
#include "eval.hh"
|
|
|
|
#define LocalNoInline(f) static f __attribute__((noinline)); f
|
|
#define LocalNoInlineNoReturn(f) static f __attribute__((noinline, noreturn)); f
|
|
|
|
namespace nix {
|
|
|
|
LocalNoInlineNoReturn(void throwEvalError(const Pos & pos, const char * s))
|
|
{
|
|
throw EvalError({
|
|
.hint = hintfmt(s),
|
|
.errPos = pos
|
|
});
|
|
}
|
|
|
|
LocalNoInlineNoReturn(void throwTypeError(const char * s, const Value & v))
|
|
{
|
|
throw TypeError(s, showType(v));
|
|
}
|
|
|
|
|
|
LocalNoInlineNoReturn(void throwTypeError(const Pos & pos, const char * s, const Value & v))
|
|
{
|
|
throw TypeError({
|
|
.hint = hintfmt(s, showType(v)),
|
|
.errPos = pos
|
|
});
|
|
}
|
|
|
|
|
|
void EvalState::forceValue(Value & v, const Pos & pos)
|
|
{
|
|
if (v.isThunk()) {
|
|
Env * env = v.thunk.env;
|
|
Expr * expr = v.thunk.expr;
|
|
try {
|
|
v.mkBlackhole();
|
|
//checkInterrupt();
|
|
expr->eval(*this, *env, v);
|
|
} catch (...) {
|
|
v.mkThunk(env, expr);
|
|
throw;
|
|
}
|
|
}
|
|
else if (v.isApp())
|
|
callFunction(*v.app.left, *v.app.right, v, noPos);
|
|
else if (v.isBlackhole())
|
|
throwEvalError(pos, "infinite recursion encountered");
|
|
}
|
|
|
|
|
|
inline void EvalState::forceAttrs(Value & v)
|
|
{
|
|
forceValue(v);
|
|
if (v.type() != nAttrs)
|
|
throwTypeError("value is %1% while a set was expected", v);
|
|
}
|
|
|
|
|
|
inline void EvalState::forceAttrs(Value & v, const Pos & pos)
|
|
{
|
|
forceValue(v, pos);
|
|
if (v.type() != nAttrs)
|
|
throwTypeError(pos, "value is %1% while a set was expected", v);
|
|
}
|
|
|
|
|
|
inline void EvalState::forceList(Value & v)
|
|
{
|
|
forceValue(v);
|
|
if (!v.isList())
|
|
throwTypeError("value is %1% while a list was expected", v);
|
|
}
|
|
|
|
|
|
inline void EvalState::forceList(Value & v, const Pos & pos)
|
|
{
|
|
forceValue(v, pos);
|
|
if (!v.isList())
|
|
throwTypeError(pos, "value is %1% while a list was expected", v);
|
|
}
|
|
|
|
/* Note: Various places expect the allocated memory to be zeroed. */
|
|
inline void * allocBytes(size_t n)
|
|
{
|
|
void * p;
|
|
#if HAVE_BOEHMGC
|
|
p = GC_MALLOC(n);
|
|
#else
|
|
p = calloc(n, 1);
|
|
#endif
|
|
if (!p) throw std::bad_alloc();
|
|
return p;
|
|
}
|
|
|
|
|
|
}
|