2003-10-30 18:48:26 +02:00
|
|
|
#ifndef __EVAL_H
|
|
|
|
#define __EVAL_H
|
|
|
|
|
|
|
|
#include <map>
|
|
|
|
|
2003-11-18 13:22:29 +02:00
|
|
|
#include "aterm.hh"
|
2003-11-18 14:06:07 +02:00
|
|
|
#include "nixexpr.hh"
|
2003-10-30 18:48:26 +02:00
|
|
|
|
|
|
|
|
2006-09-05 00:06:23 +03:00
|
|
|
namespace nix {
|
|
|
|
|
|
|
|
|
|
|
|
class Hash;
|
2010-03-29 17:37:56 +03:00
|
|
|
class EvalState;
|
|
|
|
struct Env;
|
|
|
|
struct Value;
|
|
|
|
|
|
|
|
typedef ATerm Sym;
|
|
|
|
|
|
|
|
typedef std::map<Sym, Value> Bindings;
|
|
|
|
|
|
|
|
|
|
|
|
struct Env
|
|
|
|
{
|
|
|
|
Env * up;
|
|
|
|
Bindings bindings;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
typedef enum {
|
|
|
|
tInt = 1,
|
|
|
|
tBool,
|
|
|
|
tString,
|
|
|
|
tPath,
|
|
|
|
tNull,
|
|
|
|
tAttrs,
|
|
|
|
tList,
|
|
|
|
tThunk,
|
2010-03-30 16:47:59 +03:00
|
|
|
tApp,
|
2010-03-29 17:37:56 +03:00
|
|
|
tLambda,
|
|
|
|
tCopy,
|
|
|
|
tBlackhole,
|
|
|
|
tPrimOp,
|
|
|
|
tPrimOpApp,
|
|
|
|
} ValueType;
|
|
|
|
|
|
|
|
|
|
|
|
typedef void (* PrimOp) (EvalState & state, Value * * args, Value & v);
|
|
|
|
|
|
|
|
|
|
|
|
struct Value
|
|
|
|
{
|
|
|
|
ValueType type;
|
|
|
|
union
|
|
|
|
{
|
|
|
|
int integer;
|
|
|
|
bool boolean;
|
|
|
|
struct {
|
|
|
|
const char * s;
|
|
|
|
const char * * context;
|
|
|
|
} string;
|
2010-03-30 12:22:33 +03:00
|
|
|
const char * path;
|
2010-03-29 17:37:56 +03:00
|
|
|
Bindings * attrs;
|
|
|
|
struct {
|
|
|
|
unsigned int length;
|
|
|
|
Value * elems;
|
|
|
|
} list;
|
|
|
|
struct {
|
|
|
|
Env * env;
|
|
|
|
Expr expr;
|
|
|
|
} thunk;
|
2010-03-30 16:47:59 +03:00
|
|
|
struct {
|
|
|
|
Value * left, * right;
|
|
|
|
} app;
|
2010-03-29 17:37:56 +03:00
|
|
|
struct {
|
|
|
|
Env * env;
|
|
|
|
Pattern pat;
|
|
|
|
Expr body;
|
|
|
|
} lambda;
|
|
|
|
Value * val;
|
|
|
|
struct {
|
|
|
|
PrimOp fun;
|
|
|
|
unsigned int arity;
|
|
|
|
} primOp;
|
|
|
|
struct {
|
|
|
|
Value * left, * right;
|
|
|
|
unsigned int argsLeft;
|
|
|
|
} primOpApp;
|
|
|
|
};
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static inline void mkInt(Value & v, int n)
|
|
|
|
{
|
|
|
|
v.type = tInt;
|
|
|
|
v.integer = n;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static inline void mkBool(Value & v, bool b)
|
|
|
|
{
|
|
|
|
v.type = tBool;
|
|
|
|
v.boolean = b;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-04-01 12:55:57 +03:00
|
|
|
static inline void mkThunk(Value & v, Env & env, Expr expr)
|
|
|
|
{
|
|
|
|
v.type = tThunk;
|
|
|
|
v.thunk.env = &env;
|
|
|
|
v.thunk.expr = expr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-04-01 15:04:57 +03:00
|
|
|
static inline void mkCopy(Value & v, Value & src)
|
|
|
|
{
|
|
|
|
v.type = tCopy;
|
|
|
|
v.val = &src;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-03-30 21:05:54 +03:00
|
|
|
void mkString(Value & v, const char * s);
|
2010-03-31 01:39:48 +03:00
|
|
|
void mkString(Value & v, const string & s, const PathSet & context = PathSet());
|
2010-03-30 21:05:54 +03:00
|
|
|
void mkPath(Value & v, const char * s);
|
2010-03-30 12:22:33 +03:00
|
|
|
|
|
|
|
|
2006-09-05 00:06:23 +03:00
|
|
|
typedef std::map<Path, Hash> DrvHashes;
|
2003-10-30 18:48:26 +02:00
|
|
|
|
2006-03-09 17:09:18 +02:00
|
|
|
/* Cache for calls to addToStore(); maps source paths to the store
|
|
|
|
paths. */
|
2006-09-05 00:06:23 +03:00
|
|
|
typedef std::map<Path, Path> SrcToStore;
|
2006-03-09 17:09:18 +02:00
|
|
|
|
2004-02-04 18:03:29 +02:00
|
|
|
struct EvalState;
|
2004-08-04 13:59:20 +03:00
|
|
|
|
2010-03-29 17:37:56 +03:00
|
|
|
|
|
|
|
std::ostream & operator << (std::ostream & str, Value & v);
|
2004-02-04 18:03:29 +02:00
|
|
|
|
|
|
|
|
2010-03-30 18:18:20 +03:00
|
|
|
class EvalState
|
2003-10-30 18:48:26 +02:00
|
|
|
{
|
2010-03-31 18:38:03 +03:00
|
|
|
public:
|
2003-10-31 19:09:31 +02:00
|
|
|
DrvHashes drvHashes; /* normalised derivation hashes */
|
2010-03-31 18:38:03 +03:00
|
|
|
|
|
|
|
private:
|
2006-03-09 17:09:18 +02:00
|
|
|
SrcToStore srcToStore;
|
2003-10-30 18:48:26 +02:00
|
|
|
|
2010-03-29 17:37:56 +03:00
|
|
|
unsigned long nrValues;
|
|
|
|
unsigned long nrEnvs;
|
|
|
|
unsigned long nrEvaluated;
|
2003-10-31 19:09:31 +02:00
|
|
|
|
2009-05-12 14:06:24 +03:00
|
|
|
bool allowUnsafeEquality;
|
|
|
|
|
2010-03-31 19:14:32 +03:00
|
|
|
ATermMap parseTrees;
|
|
|
|
|
2010-03-30 18:18:20 +03:00
|
|
|
public:
|
|
|
|
|
2003-10-30 18:48:26 +02:00
|
|
|
EvalState();
|
2004-02-04 18:03:29 +02:00
|
|
|
|
2010-03-30 12:22:33 +03:00
|
|
|
/* Evaluate an expression read from the given file to normal
|
|
|
|
form. */
|
|
|
|
void evalFile(const Path & path, Value & v);
|
|
|
|
|
2010-03-29 17:37:56 +03:00
|
|
|
/* Evaluate an expression to normal form, storing the result in
|
|
|
|
value `v'. */
|
|
|
|
void eval(Expr e, Value & v);
|
|
|
|
void eval(Env & env, Expr e, Value & v);
|
|
|
|
|
|
|
|
/* Evaluation the expression, then verify that it has the expected
|
|
|
|
type. */
|
|
|
|
bool evalBool(Env & env, Expr e);
|
|
|
|
|
|
|
|
/* Evaluate an expression, and recursively evaluate list elements
|
|
|
|
and attributes. */
|
|
|
|
void strictEval(Expr e, Value & v);
|
|
|
|
void strictEval(Env & env, Expr e, Value & v);
|
|
|
|
|
|
|
|
/* If `v' is a thunk, enter it and overwrite `v' with the result
|
2010-03-30 16:47:59 +03:00
|
|
|
of the evaluation of the thunk. If `v' is a delayed function
|
|
|
|
application, call the function and overwrite `v' with the
|
|
|
|
result. Otherwise, this is a no-op. */
|
2010-03-29 17:37:56 +03:00
|
|
|
void forceValue(Value & v);
|
|
|
|
|
|
|
|
/* Force `v', and then verify that it has the expected type. */
|
|
|
|
int forceInt(Value & v);
|
2010-03-31 18:38:03 +03:00
|
|
|
bool forceBool(Value & v);
|
2010-03-29 17:37:56 +03:00
|
|
|
void forceAttrs(Value & v);
|
|
|
|
void forceList(Value & v);
|
2010-03-30 16:47:59 +03:00
|
|
|
void forceFunction(Value & v); // either lambda or primop
|
2010-03-31 18:38:03 +03:00
|
|
|
string forceString(Value & v);
|
2010-03-31 22:52:29 +03:00
|
|
|
string forceString(Value & v, PathSet & context);
|
2010-03-30 21:05:54 +03:00
|
|
|
string forceStringNoCtx(Value & v);
|
2010-03-29 17:37:56 +03:00
|
|
|
|
2010-03-30 12:22:33 +03:00
|
|
|
/* String coercion. Converts strings, paths and derivations to a
|
|
|
|
string. If `coerceMore' is set, also converts nulls, integers,
|
|
|
|
booleans and lists to a string. If `copyToStore' is set,
|
|
|
|
referenced paths are copied to the Nix store as a side effect.q */
|
|
|
|
string coerceToString(Value & v, PathSet & context,
|
|
|
|
bool coerceMore = false, bool copyToStore = true);
|
|
|
|
|
|
|
|
/* Path coercion. Converts strings, paths and derivations to a
|
|
|
|
path. The result is guaranteed to be a canonicalised, absolute
|
|
|
|
path. Nothing is copied to the store. */
|
|
|
|
Path coerceToPath(Value & v, PathSet & context);
|
|
|
|
|
2010-03-29 17:37:56 +03:00
|
|
|
private:
|
|
|
|
|
|
|
|
/* The base environment, containing the builtin functions and
|
|
|
|
values. */
|
|
|
|
Env & baseEnv;
|
|
|
|
|
|
|
|
void createBaseEnv();
|
|
|
|
|
2010-03-30 17:39:27 +03:00
|
|
|
void addConstant(const string & name, Value & v);
|
|
|
|
|
2004-08-04 13:59:20 +03:00
|
|
|
void addPrimOp(const string & name,
|
|
|
|
unsigned int arity, PrimOp primOp);
|
2010-03-29 17:37:56 +03:00
|
|
|
|
|
|
|
/* Do a deep equality test between two values. That is, list
|
|
|
|
elements and attributes are compared recursively. */
|
|
|
|
bool eqValues(Value & v1, Value & v2);
|
|
|
|
|
2010-03-30 16:47:59 +03:00
|
|
|
void callFunction(Value & fun, Value & arg, Value & v);
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
2010-03-29 17:37:56 +03:00
|
|
|
/* Allocation primitives. */
|
|
|
|
Value * allocValues(unsigned int count);
|
|
|
|
Env & allocEnv();
|
2010-03-30 17:39:27 +03:00
|
|
|
|
|
|
|
void mkList(Value & v, unsigned int length);
|
2010-03-31 01:39:48 +03:00
|
|
|
void mkAttrs(Value & v);
|
2010-03-30 18:18:20 +03:00
|
|
|
|
2010-03-31 18:38:03 +03:00
|
|
|
void cloneAttrs(Value & src, Value & dst);
|
|
|
|
|
2010-03-30 18:18:20 +03:00
|
|
|
/* Print statistics. */
|
|
|
|
void printStats();
|
2003-10-30 18:48:26 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2010-03-29 17:37:56 +03:00
|
|
|
#if 0
|
2003-10-30 18:48:26 +02:00
|
|
|
/* Evaluate an expression to normal form. */
|
|
|
|
Expr evalExpr(EvalState & state, Expr e);
|
|
|
|
|
2006-08-24 16:39:22 +03:00
|
|
|
/* Evaluate an expression, and recursively evaluate list elements and
|
2006-08-30 16:10:04 +03:00
|
|
|
attributes. If `canonicalise' is true, we remove things like
|
|
|
|
position information and make sure that attribute sets are in
|
|
|
|
sorded order. */
|
2007-01-13 17:41:54 +02:00
|
|
|
Expr strictEvalExpr(EvalState & state, Expr e);
|
2006-08-24 16:39:22 +03:00
|
|
|
|
2003-10-31 19:09:31 +02:00
|
|
|
/* Specific results. */
|
2006-10-16 18:55:34 +03:00
|
|
|
string evalString(EvalState & state, Expr e, PathSet & context);
|
2006-09-22 18:29:21 +03:00
|
|
|
int evalInt(EvalState & state, Expr e);
|
2006-03-23 18:43:07 +02:00
|
|
|
bool evalBool(EvalState & state, Expr e);
|
2005-07-25 18:05:34 +03:00
|
|
|
ATermList evalList(EvalState & state, Expr e);
|
2003-10-31 19:09:31 +02:00
|
|
|
|
2006-10-16 18:55:34 +03:00
|
|
|
/* Flatten nested lists into a single list (or expand a singleton into
|
|
|
|
a list). */
|
|
|
|
ATermList flattenList(EvalState & state, Expr e);
|
|
|
|
|
2006-07-26 18:05:15 +03:00
|
|
|
/* Automatically call a function for which each argument has a default
|
2006-07-28 19:03:28 +03:00
|
|
|
value or has a binding in the `args' map. Note: result is a call,
|
|
|
|
not a normal form; it should be evaluated by calling evalExpr(). */
|
|
|
|
Expr autoCallFunction(Expr e, const ATermMap & args);
|
2010-03-29 17:37:56 +03:00
|
|
|
#endif
|
2006-07-26 18:05:15 +03:00
|
|
|
|
2010-03-29 17:37:56 +03:00
|
|
|
|
2006-09-05 00:06:23 +03:00
|
|
|
}
|
|
|
|
|
2003-10-30 18:48:26 +02:00
|
|
|
|
|
|
|
#endif /* !__EVAL_H */
|