static bool tuple_access(ast_t* ast)
{
// Left is a postfix expression, right is a lookup name.
ast_t* left = ast_child(ast);
ast_t* right = ast_sibling(left);
ast_t* type = ast_type(left);
if(is_typecheck_error(type))
return false;
// Change the lookup name to an integer index.
if(!make_tuple_index(&right))
{
ast_error(right,
"lookup on a tuple must take the form _X, where X is an integer");
return false;
}
// Make sure our index is in bounds.
type = ast_childidx(type, (size_t)ast_int(right));
if(type == NULL)
{
ast_error(right, "tuple index is out of bounds");
return false;
}
ast_setid(ast, TK_FLETREF);
ast_settype(ast, type);
ast_inheritflags(ast);
return true;
}
static bool tuple_access(pass_opt_t* opt, ast_t* ast)
{
// Left is a postfix expression, right is a lookup name.
ast_t* left = ast_child(ast);
ast_t* right = ast_sibling(left);
ast_t* type = ast_type(left);
if(is_typecheck_error(type))
return false;
// Change the lookup name to an integer index.
if(!make_tuple_index(&right))
{
ast_error(opt->check.errors, right,
"lookup on a tuple must take the form _X, where X is an integer");
return false;
}
// Make sure our index is in bounds. make_tuple_index automatically shifts
// from one indexed to zero, so we have to use -1 and >= for our comparisons.
size_t right_idx = (size_t)ast_int(right)->low;
size_t tuple_size = ast_childcount(type);
if (right_idx == (size_t)-1)
{
ast_error(opt->check.errors, right,
"tuples are one indexed not zero indexed. Did you mean _1?");
return false;
}
else if (right_idx >= tuple_size)
{
ast_error(opt->check.errors, right, "tuple index " __zu " is out of "
"valid range. Valid range is [1, " __zu "]", right_idx, tuple_size);
return false;
}
type = ast_childidx(type, right_idx);
assert(type != NULL);
ast_setid(ast, TK_FLETREF);
ast_settype(ast, type);
ast_inheritflags(ast);
return true;
}