2003-11-18 12:06:07 +00:00
|
|
|
#include "nixexpr.hh"
|
2005-01-19 16:39:47 +00:00
|
|
|
#include "derivations.hh"
|
2006-09-04 21:06:23 +00:00
|
|
|
#include "util.hh"
|
2004-10-26 22:54:26 +00:00
|
|
|
|
2008-05-21 11:17:31 +00:00
|
|
|
#include <cstdlib>
|
|
|
|
|
2004-10-26 22:54:26 +00:00
|
|
|
|
2006-09-04 21:06:23 +00:00
|
|
|
namespace nix {
|
|
|
|
|
2010-04-12 18:30:11 +00:00
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
/* Displaying abstract syntax trees. */
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
std::ostream & operator << (std::ostream & str, const Expr & e)
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
|
|
|
e.show(str);
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
2022-02-25 15:00:00 +00:00
|
|
|
static void showString(std::ostream & str, std::string_view s)
|
2014-10-20 06:44:32 +00:00
|
|
|
{
|
|
|
|
str << '"';
|
2022-02-25 15:00:00 +00:00
|
|
|
for (auto c : s)
|
2014-10-20 06:44:32 +00:00
|
|
|
if (c == '"' || c == '\\' || c == '$') str << "\\" << c;
|
|
|
|
else if (c == '\n') str << "\\n";
|
|
|
|
else if (c == '\r') str << "\\r";
|
|
|
|
else if (c == '\t') str << "\\t";
|
|
|
|
else str << c;
|
|
|
|
str << '"';
|
|
|
|
}
|
|
|
|
|
2022-02-25 15:00:00 +00:00
|
|
|
static void showId(std::ostream & str, std::string_view s)
|
2014-10-20 06:44:32 +00:00
|
|
|
{
|
2015-12-17 14:15:28 +00:00
|
|
|
if (s.empty())
|
|
|
|
str << "\"\"";
|
|
|
|
else if (s == "if") // FIXME: handle other keywords
|
2014-10-20 06:44:32 +00:00
|
|
|
str << '"' << s << '"';
|
|
|
|
else {
|
|
|
|
char c = s[0];
|
|
|
|
if (!((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_')) {
|
|
|
|
showString(str, s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
for (auto c : s)
|
|
|
|
if (!((c >= 'a' && c <= 'z') ||
|
|
|
|
(c >= 'A' && c <= 'Z') ||
|
|
|
|
(c >= '0' && c <= '9') ||
|
|
|
|
c == '_' || c == '\'' || c == '-')) {
|
|
|
|
showString(str, s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
str << s;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
std::ostream & operator << (std::ostream & str, const Symbol & sym)
|
|
|
|
{
|
|
|
|
showId(str, *sym.s);
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void Expr::show(std::ostream & str) const
|
2010-04-12 22:03:27 +00:00
|
|
|
{
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprInt::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
|
|
|
str << n;
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprFloat::show(std::ostream & str) const
|
2016-01-04 23:40:40 +00:00
|
|
|
{
|
|
|
|
str << nf;
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprString::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
2014-10-20 06:44:32 +00:00
|
|
|
showString(str, s);
|
2010-04-12 18:30:11 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprPath::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
|
|
|
str << s;
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprVar::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
2013-10-08 12:24:53 +00:00
|
|
|
str << name;
|
2010-04-12 18:30:11 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprSelect::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
2011-07-06 12:28:57 +00:00
|
|
|
str << "(" << *e << ")." << showAttrPath(attrPath);
|
2014-10-20 06:44:32 +00:00
|
|
|
if (def) str << " or (" << *def << ")";
|
2010-04-12 18:30:11 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprOpHasAttr::show(std::ostream & str) const
|
2010-04-12 21:21:24 +00:00
|
|
|
{
|
2014-10-20 06:44:32 +00:00
|
|
|
str << "((" << *e << ") ? " << showAttrPath(attrPath) << ")";
|
2010-04-12 21:21:24 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprAttrs::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
|
|
|
if (recursive) str << "rec ";
|
|
|
|
str << "{ ";
|
2022-02-25 08:21:04 +00:00
|
|
|
typedef const decltype(attrs)::value_type * Attr;
|
|
|
|
std::vector<Attr> sorted;
|
|
|
|
for (auto & i : attrs) sorted.push_back(&i);
|
|
|
|
std::sort(sorted.begin(), sorted.end(), [](Attr a, Attr b) {
|
|
|
|
return (const std::string &) a->first < (const std::string &) b->first;
|
|
|
|
});
|
|
|
|
for (auto & i : sorted) {
|
|
|
|
if (i->second.inherited)
|
|
|
|
str << "inherit " << i->first << " " << "; ";
|
2010-10-24 19:52:33 +00:00
|
|
|
else
|
2022-02-25 08:21:04 +00:00
|
|
|
str << i->first << " = " << *i->second.e << "; ";
|
|
|
|
}
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : dynamicAttrs)
|
|
|
|
str << "\"${" << *i.nameExpr << "}\" = " << *i.valueExpr << "; ";
|
2010-04-12 18:30:11 +00:00
|
|
|
str << "}";
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprList::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
|
|
|
str << "[ ";
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : elems)
|
|
|
|
str << "(" << *i << ") ";
|
2010-04-12 18:30:11 +00:00
|
|
|
str << "]";
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprLambda::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
|
|
|
str << "(";
|
2021-10-06 15:08:08 +00:00
|
|
|
if (hasFormals()) {
|
2010-04-12 18:30:11 +00:00
|
|
|
str << "{ ";
|
|
|
|
bool first = true;
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : formals->formals) {
|
2010-04-12 18:30:11 +00:00
|
|
|
if (first) first = false; else str << ", ";
|
2015-07-17 17:24:28 +00:00
|
|
|
str << i.name;
|
|
|
|
if (i.def) str << " ? " << *i.def;
|
2010-04-12 18:30:11 +00:00
|
|
|
}
|
2014-10-20 06:44:32 +00:00
|
|
|
if (formals->ellipsis) {
|
|
|
|
if (!first) str << ", ";
|
|
|
|
str << "...";
|
|
|
|
}
|
2010-04-12 18:30:11 +00:00
|
|
|
str << " }";
|
2010-04-13 12:25:42 +00:00
|
|
|
if (!arg.empty()) str << " @ ";
|
2010-04-12 18:30:11 +00:00
|
|
|
}
|
2010-04-13 12:25:42 +00:00
|
|
|
if (!arg.empty()) str << arg;
|
2010-04-12 18:30:11 +00:00
|
|
|
str << ": " << *body << ")";
|
|
|
|
}
|
|
|
|
|
2020-02-24 00:32:01 +00:00
|
|
|
void ExprCall::show(std::ostream & str) const
|
|
|
|
{
|
|
|
|
str << '(' << *fun;
|
|
|
|
for (auto e : args) {
|
|
|
|
str << ' ';
|
|
|
|
str << *e;
|
|
|
|
}
|
|
|
|
str << ')';
|
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprLet::show(std::ostream & str) const
|
2010-04-13 13:42:25 +00:00
|
|
|
{
|
2014-10-20 06:44:32 +00:00
|
|
|
str << "(let ";
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrs->attrs)
|
|
|
|
if (i.second.inherited) {
|
|
|
|
str << "inherit " << i.first << "; ";
|
2014-10-20 06:44:32 +00:00
|
|
|
}
|
2010-10-24 19:52:33 +00:00
|
|
|
else
|
2015-07-17 17:24:28 +00:00
|
|
|
str << i.first << " = " << *i.second.e << "; ";
|
2014-10-20 06:44:32 +00:00
|
|
|
str << "in " << *body << ")";
|
2010-04-13 13:42:25 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprWith::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
2014-10-20 06:44:32 +00:00
|
|
|
str << "(with " << *attrs << "; " << *body << ")";
|
2010-04-12 18:30:11 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprIf::show(std::ostream & str) const
|
2010-04-12 18:30:11 +00:00
|
|
|
{
|
2014-10-20 06:44:32 +00:00
|
|
|
str << "(if " << *cond << " then " << *then << " else " << *else_ << ")";
|
2010-04-12 18:30:11 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprAssert::show(std::ostream & str) const
|
2010-04-12 21:21:24 +00:00
|
|
|
{
|
|
|
|
str << "assert " << *cond << "; " << *body;
|
|
|
|
}
|
2010-04-12 18:30:11 +00:00
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprOpNot::show(std::ostream & str) const
|
2010-04-12 21:21:24 +00:00
|
|
|
{
|
2014-10-20 06:44:32 +00:00
|
|
|
str << "(! " << *e << ")";
|
2010-04-12 21:21:24 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprConcatStrings::show(std::ostream & str) const
|
2010-04-12 21:21:24 +00:00
|
|
|
{
|
|
|
|
bool first = true;
|
2014-10-20 06:44:32 +00:00
|
|
|
str << "(";
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : *es) {
|
2010-04-12 21:21:24 +00:00
|
|
|
if (first) first = false; else str << " + ";
|
2022-01-24 14:08:16 +00:00
|
|
|
str << *i.second;
|
2010-04-12 21:21:24 +00:00
|
|
|
}
|
2014-10-20 06:44:32 +00:00
|
|
|
str << ")";
|
2010-04-12 21:21:24 +00:00
|
|
|
}
|
|
|
|
|
2018-03-14 18:20:32 +00:00
|
|
|
void ExprPos::show(std::ostream & str) const
|
2013-11-18 19:14:54 +00:00
|
|
|
{
|
|
|
|
str << "__curPos";
|
|
|
|
}
|
|
|
|
|
2010-04-12 21:21:24 +00:00
|
|
|
|
|
|
|
std::ostream & operator << (std::ostream & str, const Pos & pos)
|
2004-04-05 22:27:41 +00:00
|
|
|
{
|
2014-04-04 19:14:11 +00:00
|
|
|
if (!pos)
|
2010-04-12 21:21:24 +00:00
|
|
|
str << "undefined position";
|
|
|
|
else
|
2020-06-30 22:31:55 +00:00
|
|
|
{
|
2020-05-21 20:28:45 +00:00
|
|
|
auto f = format(ANSI_BOLD "%1%" ANSI_NORMAL ":%2%:%3%");
|
2020-06-30 22:31:55 +00:00
|
|
|
switch (pos.origin) {
|
2020-05-21 20:28:45 +00:00
|
|
|
case foFile:
|
2022-02-25 15:00:00 +00:00
|
|
|
f % (const std::string &) pos.file;
|
2020-05-21 20:28:45 +00:00
|
|
|
break;
|
|
|
|
case foStdin:
|
|
|
|
case foString:
|
|
|
|
f % "(string)";
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
throw Error("unhandled Pos origin!");
|
|
|
|
}
|
|
|
|
str << (f % pos.line % pos.column).str();
|
|
|
|
}
|
|
|
|
|
2010-04-12 21:21:24 +00:00
|
|
|
return str;
|
2004-04-05 22:27:41 +00:00
|
|
|
}
|
2003-11-03 20:30:40 +00:00
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
|
2022-02-25 15:00:00 +00:00
|
|
|
std::string showAttrPath(const AttrPath & attrPath)
|
2011-07-06 10:58:17 +00:00
|
|
|
{
|
2013-12-31 23:56:26 +00:00
|
|
|
std::ostringstream out;
|
|
|
|
bool first = true;
|
2015-03-06 13:24:08 +00:00
|
|
|
for (auto & i : attrPath) {
|
|
|
|
if (!first) out << '.'; else first = false;
|
|
|
|
if (i.symbol.set())
|
|
|
|
out << i.symbol;
|
2013-12-31 23:56:26 +00:00
|
|
|
else
|
2015-03-06 13:24:08 +00:00
|
|
|
out << "\"${" << *i.expr << "}\"";
|
2011-07-06 10:58:17 +00:00
|
|
|
}
|
2013-12-31 23:56:26 +00:00
|
|
|
return out.str();
|
2011-07-06 10:58:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-05-06 16:46:48 +00:00
|
|
|
Pos noPos;
|
|
|
|
|
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
/* Computing levels/displacements for variables. */
|
|
|
|
|
|
|
|
void Expr::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExprInt::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2016-01-04 23:40:40 +00:00
|
|
|
void ExprFloat::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
void ExprString::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExprPath::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2013-10-08 12:24:53 +00:00
|
|
|
void ExprVar::bindVars(const StaticEnv & env)
|
2010-04-14 14:42:32 +00:00
|
|
|
{
|
|
|
|
/* Check whether the variable appears in the environment. If so,
|
|
|
|
set its level and displacement. */
|
|
|
|
const StaticEnv * curEnv;
|
2020-02-24 13:33:01 +00:00
|
|
|
Level level;
|
2010-04-14 14:42:32 +00:00
|
|
|
int withLevel = -1;
|
|
|
|
for (curEnv = &env, level = 0; curEnv; curEnv = curEnv->up, level++) {
|
|
|
|
if (curEnv->isWith) {
|
|
|
|
if (withLevel == -1) withLevel = level;
|
|
|
|
} else {
|
2020-02-21 17:31:16 +00:00
|
|
|
auto i = curEnv->find(name);
|
2010-04-14 14:42:32 +00:00
|
|
|
if (i != curEnv->vars.end()) {
|
|
|
|
fromWith = false;
|
|
|
|
this->level = level;
|
|
|
|
displ = i->second;
|
|
|
|
return;
|
|
|
|
}
|
2008-08-14 10:04:22 +00:00
|
|
|
}
|
|
|
|
}
|
2010-04-14 14:42:32 +00:00
|
|
|
|
|
|
|
/* Otherwise, the variable must be obtained from the nearest
|
|
|
|
enclosing `with'. If there is no `with', then we can issue an
|
|
|
|
"undefined variable" error now. */
|
2020-06-15 12:12:39 +00:00
|
|
|
if (withLevel == -1)
|
2020-06-15 12:06:58 +00:00
|
|
|
throw UndefinedVarError({
|
2021-01-20 23:27:36 +00:00
|
|
|
.msg = hintfmt("undefined variable '%1%'", name),
|
2020-06-23 21:30:13 +00:00
|
|
|
.errPos = pos
|
2020-06-15 12:06:58 +00:00
|
|
|
});
|
2010-04-14 14:42:32 +00:00
|
|
|
fromWith = true;
|
|
|
|
this->level = withLevel;
|
2008-08-14 10:04:22 +00:00
|
|
|
}
|
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
void ExprSelect::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
e->bindVars(env);
|
2011-07-13 12:19:57 +00:00
|
|
|
if (def) def->bindVars(env);
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrPath)
|
|
|
|
if (!i.symbol.set())
|
|
|
|
i.expr->bindVars(env);
|
2010-04-14 14:42:32 +00:00
|
|
|
}
|
2008-08-14 10:04:22 +00:00
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
void ExprOpHasAttr::bindVars(const StaticEnv & env)
|
2004-02-03 14:45:34 +00:00
|
|
|
{
|
2010-04-14 14:42:32 +00:00
|
|
|
e->bindVars(env);
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrPath)
|
|
|
|
if (!i.symbol.set())
|
|
|
|
i.expr->bindVars(env);
|
2010-04-14 14:42:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ExprAttrs::bindVars(const StaticEnv & env)
|
|
|
|
{
|
2014-04-01 15:04:38 +00:00
|
|
|
const StaticEnv * dynamicEnv = &env;
|
2020-02-21 17:31:16 +00:00
|
|
|
StaticEnv newEnv(false, &env, recursive ? attrs.size() : 0);
|
2014-04-01 15:04:38 +00:00
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
if (recursive) {
|
Dynamic attrs
This adds new syntax for attribute names:
* attrs."${name}" => getAttr name attrs
* attrs ? "${name}" => isAttrs attrs && hasAttr attrs name
* attrs."${name}" or def => if attrs ? "${name}" then attrs."${name}" else def
* { "${name}" = value; } => listToAttrs [{ inherit name value; }]
Of course, it's a bit more complicated than that. The attribute chains
can be arbitrarily long and contain combinations of static and dynamic
parts (e.g. attrs."${foo}".bar."${baz}" or qux), which is relatively
straightforward for the getAttrs/hasAttrs cases but is more complex for
the listToAttrs case due to rules about duplicate attribute definitions.
For attribute sets with dynamic attribute names, duplicate static
attributes are detected at parse time while duplicate dynamic attributes
are detected when the attribute set is forced. So, for example, { a =
null; a.b = null; "${"c"}" = true; } will be a parse-time error, while
{ a = {}; "${"a"}".b = null; c = true; } will be an eval-time error
(technically that case could theoretically be detected at parse time,
but the general case would require full evaluation). Moreover, duplicate
dynamic attributes are not allowed even in cases where they would be
with static attributes ({ a.b.d = true; a.b.c = false; } is legal, but {
a."${"b"}".d = true; a."${"b"}".c = false; } is not). This restriction
might be relaxed in the future in cases where the static variant would
not be an error, but it is not obvious that that is desirable.
Finally, recursive attribute sets with dynamic attributes have the
static attributes in scope but not the dynamic ones. So rec { a = true;
"${"b"}" = a; } is equivalent to { a = true; b = true; } but rec {
"${"a"}" = true; b = a; } would be an error or use a from the
surrounding scope if it exists.
Note that the getAttr, getAttr or default, and hasAttr are all
implemented purely in the parser as syntactic sugar, while attribute
sets with dynamic attribute names required changes to the AST to be
implemented cleanly.
This is an alternative solution to and closes #167
Signed-off-by: Shea Levy <shea@shealevy.com>
2013-09-21 03:25:30 +00:00
|
|
|
dynamicEnv = &newEnv;
|
2013-09-02 14:29:15 +00:00
|
|
|
|
2020-02-24 13:33:01 +00:00
|
|
|
Displacement displ = 0;
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrs)
|
2020-02-21 17:31:16 +00:00
|
|
|
newEnv.vars.emplace_back(i.first, i.second.displ = displ++);
|
|
|
|
|
|
|
|
// No need to sort newEnv since attrs is in sorted order.
|
2013-09-02 14:29:15 +00:00
|
|
|
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrs)
|
|
|
|
i.second.e->bindVars(i.second.inherited ? env : newEnv);
|
2004-10-25 16:54:56 +00:00
|
|
|
}
|
2010-04-14 14:42:32 +00:00
|
|
|
|
2010-10-24 19:52:33 +00:00
|
|
|
else
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrs)
|
|
|
|
i.second.e->bindVars(env);
|
Dynamic attrs
This adds new syntax for attribute names:
* attrs."${name}" => getAttr name attrs
* attrs ? "${name}" => isAttrs attrs && hasAttr attrs name
* attrs."${name}" or def => if attrs ? "${name}" then attrs."${name}" else def
* { "${name}" = value; } => listToAttrs [{ inherit name value; }]
Of course, it's a bit more complicated than that. The attribute chains
can be arbitrarily long and contain combinations of static and dynamic
parts (e.g. attrs."${foo}".bar."${baz}" or qux), which is relatively
straightforward for the getAttrs/hasAttrs cases but is more complex for
the listToAttrs case due to rules about duplicate attribute definitions.
For attribute sets with dynamic attribute names, duplicate static
attributes are detected at parse time while duplicate dynamic attributes
are detected when the attribute set is forced. So, for example, { a =
null; a.b = null; "${"c"}" = true; } will be a parse-time error, while
{ a = {}; "${"a"}".b = null; c = true; } will be an eval-time error
(technically that case could theoretically be detected at parse time,
but the general case would require full evaluation). Moreover, duplicate
dynamic attributes are not allowed even in cases where they would be
with static attributes ({ a.b.d = true; a.b.c = false; } is legal, but {
a."${"b"}".d = true; a."${"b"}".c = false; } is not). This restriction
might be relaxed in the future in cases where the static variant would
not be an error, but it is not obvious that that is desirable.
Finally, recursive attribute sets with dynamic attributes have the
static attributes in scope but not the dynamic ones. So rec { a = true;
"${"b"}" = a; } is equivalent to { a = true; b = true; } but rec {
"${"a"}" = true; b = a; } would be an error or use a from the
surrounding scope if it exists.
Note that the getAttr, getAttr or default, and hasAttr are all
implemented purely in the parser as syntactic sugar, while attribute
sets with dynamic attribute names required changes to the AST to be
implemented cleanly.
This is an alternative solution to and closes #167
Signed-off-by: Shea Levy <shea@shealevy.com>
2013-09-21 03:25:30 +00:00
|
|
|
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : dynamicAttrs) {
|
|
|
|
i.nameExpr->bindVars(*dynamicEnv);
|
|
|
|
i.valueExpr->bindVars(*dynamicEnv);
|
Dynamic attrs
This adds new syntax for attribute names:
* attrs."${name}" => getAttr name attrs
* attrs ? "${name}" => isAttrs attrs && hasAttr attrs name
* attrs."${name}" or def => if attrs ? "${name}" then attrs."${name}" else def
* { "${name}" = value; } => listToAttrs [{ inherit name value; }]
Of course, it's a bit more complicated than that. The attribute chains
can be arbitrarily long and contain combinations of static and dynamic
parts (e.g. attrs."${foo}".bar."${baz}" or qux), which is relatively
straightforward for the getAttrs/hasAttrs cases but is more complex for
the listToAttrs case due to rules about duplicate attribute definitions.
For attribute sets with dynamic attribute names, duplicate static
attributes are detected at parse time while duplicate dynamic attributes
are detected when the attribute set is forced. So, for example, { a =
null; a.b = null; "${"c"}" = true; } will be a parse-time error, while
{ a = {}; "${"a"}".b = null; c = true; } will be an eval-time error
(technically that case could theoretically be detected at parse time,
but the general case would require full evaluation). Moreover, duplicate
dynamic attributes are not allowed even in cases where they would be
with static attributes ({ a.b.d = true; a.b.c = false; } is legal, but {
a."${"b"}".d = true; a."${"b"}".c = false; } is not). This restriction
might be relaxed in the future in cases where the static variant would
not be an error, but it is not obvious that that is desirable.
Finally, recursive attribute sets with dynamic attributes have the
static attributes in scope but not the dynamic ones. So rec { a = true;
"${"b"}" = a; } is equivalent to { a = true; b = true; } but rec {
"${"a"}" = true; b = a; } would be an error or use a from the
surrounding scope if it exists.
Note that the getAttr, getAttr or default, and hasAttr are all
implemented purely in the parser as syntactic sugar, while attribute
sets with dynamic attribute names required changes to the AST to be
implemented cleanly.
This is an alternative solution to and closes #167
Signed-off-by: Shea Levy <shea@shealevy.com>
2013-09-21 03:25:30 +00:00
|
|
|
}
|
2010-04-14 14:42:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ExprList::bindVars(const StaticEnv & env)
|
|
|
|
{
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : elems)
|
|
|
|
i->bindVars(env);
|
2010-04-14 14:42:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ExprLambda::bindVars(const StaticEnv & env)
|
|
|
|
{
|
2020-02-21 17:31:16 +00:00
|
|
|
StaticEnv newEnv(
|
|
|
|
false, &env,
|
|
|
|
(hasFormals() ? formals->formals.size() : 0) +
|
|
|
|
(arg.empty() ? 0 : 1));
|
2013-09-02 14:29:15 +00:00
|
|
|
|
2020-02-24 13:33:01 +00:00
|
|
|
Displacement displ = 0;
|
2013-09-02 14:29:15 +00:00
|
|
|
|
2020-02-21 17:31:16 +00:00
|
|
|
if (!arg.empty()) newEnv.vars.emplace_back(arg, displ++);
|
2010-04-14 14:42:32 +00:00
|
|
|
|
2021-10-06 15:08:08 +00:00
|
|
|
if (hasFormals()) {
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : formals->formals)
|
2020-02-21 17:31:16 +00:00
|
|
|
newEnv.vars.emplace_back(i.name, displ++);
|
|
|
|
|
|
|
|
newEnv.sort();
|
2010-04-14 14:42:32 +00:00
|
|
|
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : formals->formals)
|
|
|
|
if (i.def) i.def->bindVars(newEnv);
|
2004-02-03 14:45:34 +00:00
|
|
|
}
|
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
body->bindVars(newEnv);
|
|
|
|
}
|
|
|
|
|
2020-02-24 00:32:01 +00:00
|
|
|
void ExprCall::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
fun->bindVars(env);
|
|
|
|
for (auto e : args)
|
|
|
|
e->bindVars(env);
|
|
|
|
}
|
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
void ExprLet::bindVars(const StaticEnv & env)
|
|
|
|
{
|
2020-02-21 17:31:16 +00:00
|
|
|
StaticEnv newEnv(false, &env, attrs->attrs.size());
|
2013-09-02 14:29:15 +00:00
|
|
|
|
2020-02-24 13:33:01 +00:00
|
|
|
Displacement displ = 0;
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrs->attrs)
|
2020-02-21 17:31:16 +00:00
|
|
|
newEnv.vars.emplace_back(i.first, i.second.displ = displ++);
|
|
|
|
|
|
|
|
// No need to sort newEnv since attrs->attrs is in sorted order.
|
2013-09-02 14:29:15 +00:00
|
|
|
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : attrs->attrs)
|
|
|
|
i.second.e->bindVars(i.second.inherited ? env : newEnv);
|
2013-09-02 14:29:15 +00:00
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
body->bindVars(newEnv);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExprWith::bindVars(const StaticEnv & env)
|
|
|
|
{
|
2010-04-14 15:01:04 +00:00
|
|
|
/* Does this `with' have an enclosing `with'? If so, record its
|
2010-04-22 15:08:09 +00:00
|
|
|
level so that `lookupVar' can look up variables in the previous
|
|
|
|
`with' if this one doesn't contain the desired attribute. */
|
2010-04-14 15:01:04 +00:00
|
|
|
const StaticEnv * curEnv;
|
2020-02-24 13:33:01 +00:00
|
|
|
Level level;
|
2010-04-22 15:08:09 +00:00
|
|
|
prevWith = 0;
|
|
|
|
for (curEnv = &env, level = 1; curEnv; curEnv = curEnv->up, level++)
|
2010-04-14 15:01:04 +00:00
|
|
|
if (curEnv->isWith) {
|
|
|
|
prevWith = level;
|
|
|
|
break;
|
|
|
|
}
|
2013-09-02 14:29:15 +00:00
|
|
|
|
|
|
|
attrs->bindVars(env);
|
2010-04-14 14:42:32 +00:00
|
|
|
StaticEnv newEnv(true, &env);
|
|
|
|
body->bindVars(newEnv);
|
2005-11-04 15:17:05 +00:00
|
|
|
}
|
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
void ExprIf::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
cond->bindVars(env);
|
|
|
|
then->bindVars(env);
|
|
|
|
else_->bindVars(env);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExprAssert::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
cond->bindVars(env);
|
|
|
|
body->bindVars(env);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExprOpNot::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
e->bindVars(env);
|
|
|
|
}
|
2005-11-04 15:17:05 +00:00
|
|
|
|
2010-04-14 14:42:32 +00:00
|
|
|
void ExprConcatStrings::bindVars(const StaticEnv & env)
|
2005-11-04 15:17:05 +00:00
|
|
|
{
|
2015-07-17 17:24:28 +00:00
|
|
|
for (auto & i : *es)
|
2021-09-23 02:30:31 +00:00
|
|
|
i.second->bindVars(env);
|
2004-02-03 14:45:34 +00:00
|
|
|
}
|
2006-10-16 15:55:34 +00:00
|
|
|
|
2013-11-18 19:14:54 +00:00
|
|
|
void ExprPos::bindVars(const StaticEnv & env)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2006-10-16 15:55:34 +00:00
|
|
|
|
2013-05-16 17:08:02 +00:00
|
|
|
/* Storing function names. */
|
|
|
|
|
|
|
|
void Expr::setName(Symbol & name)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void ExprLambda::setName(Symbol & name)
|
|
|
|
{
|
|
|
|
this->name = name;
|
|
|
|
body->setName(name);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2022-02-25 15:00:00 +00:00
|
|
|
std::string ExprLambda::showNamePos() const
|
2013-05-16 17:08:02 +00:00
|
|
|
{
|
2022-02-25 15:00:00 +00:00
|
|
|
return fmt("%1% at %2%", name.set() ? "'" + (std::string) name + "'" : "anonymous function", pos);
|
2013-05-16 17:08:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-10-08 13:34:57 +00:00
|
|
|
|
|
|
|
/* Symbol table. */
|
|
|
|
|
|
|
|
size_t SymbolTable::totalSize() const
|
|
|
|
{
|
|
|
|
size_t n = 0;
|
2021-12-20 10:29:14 +00:00
|
|
|
for (auto & i : store)
|
2015-07-17 17:24:28 +00:00
|
|
|
n += i.size();
|
2013-10-08 13:34:57 +00:00
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2006-09-04 21:06:23 +00:00
|
|
|
}
|