Wrap up source code and a parse tree into a new type parsed_source_ref_t

This will make it unnecessary to carry around the parse tree and source
separately, and enable some simplifications.
This commit is contained in:
ridiculousfish 2017-12-22 14:40:15 -08:00
parent eeff32cde7
commit a99eecfad8
9 changed files with 95 additions and 78 deletions

View file

@ -77,36 +77,30 @@ static wcstring profiling_cmd_name_for_redirectable_block(const parse_node_t &no
return result; return result;
} }
parse_execution_context_t::parse_execution_context_t(parse_node_tree_t t, const wcstring &s, parse_execution_context_t::parse_execution_context_t(parsed_source_ref_t pstree, parser_t *p,
parser_t *p, int initial_eval_level) int initial_eval_level)
: tree(std::move(t)), : pstree(std::move(pstree)), parser(p), eval_level(initial_eval_level) {}
src(s),
parser(p),
eval_level(initial_eval_level),
executing_node_idx(NODE_OFFSET_INVALID),
cached_lineno_offset(0),
cached_lineno_count(0) {}
// Utilities // Utilities
wcstring parse_execution_context_t::get_source(const parse_node_t &node) const { wcstring parse_execution_context_t::get_source(const parse_node_t &node) const {
return node.get_source(this->src); return node.get_source(pstree->src);
} }
const parse_node_t *parse_execution_context_t::get_child(const parse_node_t &parent, const parse_node_t *parse_execution_context_t::get_child(const parse_node_t &parent,
node_offset_t which, node_offset_t which,
parse_token_type_t expected_type) const { parse_token_type_t expected_type) const {
return this->tree.get_child(parent, which, expected_type); return this->tree().get_child(parent, which, expected_type);
} }
node_offset_t parse_execution_context_t::get_offset(const parse_node_t &node) const { node_offset_t parse_execution_context_t::get_offset(const parse_node_t &node) const {
// Get the offset of a node via pointer arithmetic, very hackish. // Get the offset of a node via pointer arithmetic, very hackish.
const parse_node_t *addr = &node; const parse_node_t *addr = &node;
const parse_node_t *base = &this->tree.at(0); const parse_node_t *base = &this->tree().at(0);
assert(addr >= base); assert(addr >= base);
node_offset_t offset = static_cast<node_offset_t>(addr - base); node_offset_t offset = static_cast<node_offset_t>(addr - base);
assert(offset < this->tree.size()); assert(offset < this->tree().size());
assert(&tree.at(offset) == &node); assert(&tree().at(offset) == &node);
return offset; return offset;
} }
@ -130,7 +124,7 @@ const parse_node_t *parse_execution_context_t::infinite_recursive_statement_in_j
const wcstring &forbidden_function_name = parser->forbidden_function.back(); const wcstring &forbidden_function_name = parser->forbidden_function.back();
// Get the first job in the job list. // Get the first job in the job list.
const parse_node_t *first_job = tree.next_node_in_node_list(job_list, symbol_job, NULL); const parse_node_t *first_job = tree().next_node_in_node_list(job_list, symbol_job, NULL);
if (first_job == NULL) { if (first_job == NULL) {
return NULL; return NULL;
} }
@ -140,7 +134,7 @@ const parse_node_t *parse_execution_context_t::infinite_recursive_statement_in_j
// Get the list of statements. // Get the list of statements.
const parse_node_tree_t::parse_node_list_t statements = const parse_node_tree_t::parse_node_list_t statements =
tree.specific_statements_for_job(*first_job); tree().specific_statements_for_job(*first_job);
// Find all the decorated statements. We are interested in statements with no decoration (i.e. // Find all the decorated statements. We are interested in statements with no decoration (i.e.
// not command, not builtin) whose command expands to the forbidden function. // not command, not builtin) whose command expands to the forbidden function.
@ -151,8 +145,8 @@ const parse_node_t *parse_execution_context_t::infinite_recursive_statement_in_j
continue; continue;
} }
const parse_node_t &plain_statement = tree.find_child(statement, symbol_plain_statement); const parse_node_t &plain_statement = tree().find_child(statement, symbol_plain_statement);
if (tree.decoration_for_plain_statement(plain_statement) != if (tree().decoration_for_plain_statement(plain_statement) !=
parse_statement_decoration_none) { parse_statement_decoration_none) {
// This statement has a decoration like 'builtin' or 'command', and therefore is not // This statement has a decoration like 'builtin' or 'command', and therefore is not
// infinite recursion. In particular this is what enables 'wrapper functions'. // infinite recursion. In particular this is what enables 'wrapper functions'.
@ -161,7 +155,7 @@ const parse_node_t *parse_execution_context_t::infinite_recursive_statement_in_j
// Ok, this is an undecorated plain statement. Get and expand its command. // Ok, this is an undecorated plain statement. Get and expand its command.
wcstring cmd; wcstring cmd;
tree.command_for_plain_statement(plain_statement, src, &cmd); tree().command_for_plain_statement(plain_statement, pstree->src, &cmd);
if (expand_one(cmd, EXPAND_SKIP_CMDSUBST | EXPAND_SKIP_VARIABLES, NULL) && if (expand_one(cmd, EXPAND_SKIP_CMDSUBST | EXPAND_SKIP_VARIABLES, NULL) &&
cmd == forbidden_function_name) { cmd == forbidden_function_name) {
@ -187,7 +181,7 @@ enum process_type_t parse_execution_context_t::process_type_for_command(
// Determine the process type, which depends on the statement decoration (command, builtin, // Determine the process type, which depends on the statement decoration (command, builtin,
// etc). // etc).
enum parse_statement_decoration_t decoration = enum parse_statement_decoration_t decoration =
tree.decoration_for_plain_statement(plain_statement); tree().decoration_for_plain_statement(plain_statement);
if (decoration == parse_statement_decoration_exec) { if (decoration == parse_statement_decoration_exec) {
// Always exec. // Always exec.
@ -251,7 +245,7 @@ bool parse_execution_context_t::job_is_simple_block(const parse_node_t &job_node
// Check for arguments and redirections. All of the above types have an arguments / redirections // Check for arguments and redirections. All of the above types have an arguments / redirections
// list. It must be empty. // list. It must be empty.
const parse_node_t &args_and_redirections = const parse_node_t &args_and_redirections =
tree.find_child(specific_statement, symbol_arguments_or_redirections_list); tree().find_child(specific_statement, symbol_arguments_or_redirections_list);
if (args_and_redirections.child_count > 0) { if (args_and_redirections.child_count > 0) {
// Non-empty, we have an argument or redirection. // Non-empty, we have an argument or redirection.
return false; return false;
@ -378,16 +372,16 @@ parse_execution_result_t parse_execution_context_t::run_function_statement(
assert(contents_end >= contents_start); assert(contents_end >= contents_start);
// Swallow whitespace at both ends. // Swallow whitespace at both ends.
while (contents_start < contents_end && iswspace(this->src.at(contents_start))) { while (contents_start < contents_end && iswspace(pstree->src.at(contents_start))) {
contents_start++; contents_start++;
} }
while (contents_start < contents_end && iswspace(this->src.at(contents_end - 1))) { while (contents_start < contents_end && iswspace(pstree->src.at(contents_end - 1))) {
contents_end--; contents_end--;
} }
assert(contents_end >= contents_start); assert(contents_end >= contents_start);
const wcstring contents_str = const wcstring contents_str =
wcstring(this->src, contents_start, contents_end - contents_start); wcstring(pstree->src, contents_start, contents_end - contents_start);
int definition_line_offset = this->line_offset_of_character_at_offset(contents_start); int definition_line_offset = this->line_offset_of_character_at_offset(contents_start);
io_streams_t streams(0); // no limit on the amount of output from builtin_function() io_streams_t streams(0); // no limit on the amount of output from builtin_function()
int err = int err =
@ -580,7 +574,7 @@ parse_execution_result_t parse_execution_context_t::run_switch_statement(
// Get the next item and the remainder of the list. // Get the next item and the remainder of the list.
const parse_node_t *case_item = const parse_node_t *case_item =
tree.next_node_in_node_list(*case_item_list, symbol_case_item, &case_item_list); tree().next_node_in_node_list(*case_item_list, symbol_case_item, &case_item_list);
if (case_item == NULL) { if (case_item == NULL) {
// No more items. // No more items.
break; break;
@ -711,7 +705,7 @@ parse_execution_result_t parse_execution_context_t::report_errors(
// Get a backtrace. // Get a backtrace.
wcstring backtrace_and_desc; wcstring backtrace_and_desc;
parser->get_backtrace(src, error_list, backtrace_and_desc); parser->get_backtrace(pstree->src, error_list, backtrace_and_desc);
// Print it. // Print it.
if (!should_suppress_stderr_for_tests()) { if (!should_suppress_stderr_for_tests()) {
@ -770,7 +764,7 @@ parse_execution_result_t parse_execution_context_t::handle_command_not_found(
const wcstring val_str = wcstring(equals_ptr + 1); // variable value, past the = const wcstring val_str = wcstring(equals_ptr + 1); // variable value, past the =
const parse_node_tree_t::parse_node_list_t args = const parse_node_tree_t::parse_node_list_t args =
tree.find_nodes(statement_node, symbol_argument, 1); tree().find_nodes(statement_node, symbol_argument, 1);
if (!args.empty()) { if (!args.empty()) {
const wcstring argument = get_source(*args.at(0)); const wcstring argument = get_source(*args.at(0));
@ -836,7 +830,7 @@ parse_execution_result_t parse_execution_context_t::populate_plain_process(
// Get the command. We expect to always get it here. // Get the command. We expect to always get it here.
wcstring cmd; wcstring cmd;
bool got_cmd = tree.command_for_plain_statement(statement, src, &cmd); bool got_cmd = tree().command_for_plain_statement(statement, pstree->src, &cmd);
assert(got_cmd); assert(got_cmd);
// Expand it as a command. Return an error on failure. // Expand it as a command. Return an error on failure.
@ -868,7 +862,7 @@ parse_execution_result_t parse_execution_context_t::populate_plain_process(
// If the specified command does not exist, and is undecorated, try using an implicit cd. // If the specified command does not exist, and is undecorated, try using an implicit cd.
if (!has_command && if (!has_command &&
tree.decoration_for_plain_statement(statement) == parse_statement_decoration_none) { tree().decoration_for_plain_statement(statement) == parse_statement_decoration_none) {
// Implicit cd requires an empty argument and redirection list. // Implicit cd requires an empty argument and redirection list.
const parse_node_t *args = const parse_node_t *args =
get_child(statement, 1, symbol_arguments_or_redirections_list); get_child(statement, 1, symbol_arguments_or_redirections_list);
@ -931,7 +925,7 @@ parse_execution_result_t parse_execution_context_t::determine_arguments(
// Get all argument nodes underneath the statement. We guess we'll have that many arguments (but // Get all argument nodes underneath the statement. We guess we'll have that many arguments (but
// may have more or fewer, if there are wildcards involved). // may have more or fewer, if there are wildcards involved).
const parse_node_tree_t::parse_node_list_t argument_nodes = const parse_node_tree_t::parse_node_list_t argument_nodes =
tree.find_nodes(parent, symbol_argument); tree().find_nodes(parent, symbol_argument);
out_arguments->reserve(out_arguments->size() + argument_nodes.size()); out_arguments->reserve(out_arguments->size() + argument_nodes.size());
std::vector<completion_t> arg_expanded; std::vector<completion_t> arg_expanded;
for (size_t i = 0; i < argument_nodes.size(); i++) { for (size_t i = 0; i < argument_nodes.size(); i++) {
@ -939,7 +933,7 @@ parse_execution_result_t parse_execution_context_t::determine_arguments(
// Expect all arguments to have source. // Expect all arguments to have source.
assert(arg_node.has_source()); assert(arg_node.has_source());
const wcstring arg_str = arg_node.get_source(src); const wcstring arg_str = arg_node.get_source(pstree->src);
// Expand this string. // Expand this string.
parse_error_list_t errors; parse_error_list_t errors;
@ -988,18 +982,18 @@ bool parse_execution_context_t::determine_io_chain(const parse_node_t &statement
// We are called with a statement of varying types. We require that the statement have an // We are called with a statement of varying types. We require that the statement have an
// arguments_or_redirections_list child. // arguments_or_redirections_list child.
const parse_node_t &args_and_redirections_list = const parse_node_t &args_and_redirections_list =
tree.find_child(statement_node, symbol_arguments_or_redirections_list); tree().find_child(statement_node, symbol_arguments_or_redirections_list);
// Get all redirection nodes underneath the statement. // Get all redirection nodes underneath the statement.
const parse_node_tree_t::parse_node_list_t redirect_nodes = const parse_node_tree_t::parse_node_list_t redirect_nodes =
tree.find_nodes(args_and_redirections_list, symbol_redirection); tree().find_nodes(args_and_redirections_list, symbol_redirection);
for (size_t i = 0; i < redirect_nodes.size(); i++) { for (size_t i = 0; i < redirect_nodes.size(); i++) {
const parse_node_t &redirect_node = *redirect_nodes.at(i); const parse_node_t &redirect_node = *redirect_nodes.at(i);
int source_fd = -1; // source fd int source_fd = -1; // source fd
wcstring target; // file path or target fd wcstring target; // file path or target fd
enum token_type redirect_type = enum token_type redirect_type =
tree.type_for_redirection(redirect_node, src, &source_fd, &target); tree().type_for_redirection(redirect_node, pstree->src, &source_fd, &target);
// PCA: I can't justify this EXPAND_SKIP_VARIABLES flag. It was like this when I got here. // PCA: I can't justify this EXPAND_SKIP_VARIABLES flag. It was like this when I got here.
bool target_expanded = expand_one(target, no_exec ? EXPAND_SKIP_VARIABLES : 0, NULL); bool target_expanded = expand_one(target, no_exec ? EXPAND_SKIP_VARIABLES : 0, NULL);
@ -1084,7 +1078,7 @@ parse_execution_result_t parse_execution_context_t::populate_boolean_process(
if (skip_job) { if (skip_job) {
return parse_execution_skipped; return parse_execution_skipped;
} }
const parse_node_t &subject = *tree.get_child(bool_statement, 1, symbol_statement); const parse_node_t &subject = *tree().get_child(bool_statement, 1, symbol_statement);
return this->populate_job_process(job, proc, subject); return this->populate_job_process(job, proc, subject);
} }
@ -1133,7 +1127,7 @@ parse_execution_result_t parse_execution_context_t::populate_job_process(
case symbol_decorated_statement: { case symbol_decorated_statement: {
// Get the plain statement. It will pull out the decoration itself. // Get the plain statement. It will pull out the decoration itself.
const parse_node_t &plain_statement = const parse_node_t &plain_statement =
tree.find_child(specific_statement, symbol_plain_statement); tree().find_child(specific_statement, symbol_plain_statement);
result = this->populate_plain_process(job, proc, plain_statement); result = this->populate_plain_process(job, proc, plain_statement);
break; break;
} }
@ -1275,8 +1269,8 @@ parse_execution_result_t parse_execution_context_t::run_1_job(const parse_node_t
profile_item->level = eval_level; profile_item->level = eval_level;
profile_item->parse = 0; profile_item->parse = 0;
profile_item->exec = (int)(exec_time - start_time); profile_item->exec = (int)(exec_time - start_time);
profile_item->cmd = profiling_cmd_name_for_redirectable_block(specific_statement, profile_item->cmd = profiling_cmd_name_for_redirectable_block(
this->tree, this->src); specific_statement, this->tree(), this->pstree->src);
profile_item->skipped = false; profile_item->skipped = false;
} }
@ -1289,7 +1283,7 @@ parse_execution_result_t parse_execution_context_t::run_1_job(const parse_node_t
(job_control_mode == JOB_CONTROL_ALL) || (job_control_mode == JOB_CONTROL_ALL) ||
((job_control_mode == JOB_CONTROL_INTERACTIVE) && shell_is_interactive())); ((job_control_mode == JOB_CONTROL_INTERACTIVE) && shell_is_interactive()));
job->set_flag(JOB_FOREGROUND, !tree.job_should_be_backgrounded(job_node)); job->set_flag(JOB_FOREGROUND, !tree().job_should_be_backgrounded(job_node));
job->set_flag(JOB_TERMINAL, job->get_flag(JOB_CONTROL) && !is_event); job->set_flag(JOB_TERMINAL, job->get_flag(JOB_CONTROL) && !is_event);
@ -1362,7 +1356,7 @@ parse_execution_result_t parse_execution_context_t::run_job_list(const parse_nod
assert(job_list->type == symbol_job_list || job_list_node.type == symbol_andor_job_list); assert(job_list->type == symbol_job_list || job_list_node.type == symbol_andor_job_list);
// Try pulling out a job. // Try pulling out a job.
const parse_node_t *job = tree.next_node_in_node_list(*job_list, symbol_job, &job_list); const parse_node_t *job = tree().next_node_in_node_list(*job_list, symbol_job, &job_list);
if (job != NULL) { if (job != NULL) {
result = this->run_1_job(*job, associated_block); result = this->run_1_job(*job, associated_block);
@ -1376,13 +1370,13 @@ parse_execution_result_t parse_execution_context_t::run_job_list(const parse_nod
parse_execution_result_t parse_execution_context_t::eval_node_at_offset( parse_execution_result_t parse_execution_context_t::eval_node_at_offset(
node_offset_t offset, const block_t *associated_block, const io_chain_t &io) { node_offset_t offset, const block_t *associated_block, const io_chain_t &io) {
// Don't ever expect to have an empty tree if this is called. // Don't ever expect to have an empty tree if this is called.
assert(!tree.empty()); //!OCLINT(multiple unary operator) assert(!tree().empty()); //!OCLINT(multiple unary operator)
assert(offset < tree.size()); assert(offset < tree().size());
// Apply this block IO for the duration of this function. // Apply this block IO for the duration of this function.
scoped_push<io_chain_t> block_io_push(&block_io, io); scoped_push<io_chain_t> block_io_push(&block_io, io);
const parse_node_t &node = tree.at(offset); const parse_node_t &node = tree().at(offset);
// Currently, we only expect to execute the top level job list, or a block node. Assert that. // Currently, we only expect to execute the top level job list, or a block node. Assert that.
assert(node.type == symbol_job_list || specific_statement_type_is_redirectable_block(node)); assert(node.type == symbol_job_list || specific_statement_type_is_redirectable_block(node));
@ -1439,18 +1433,18 @@ int parse_execution_context_t::line_offset_of_node_at_offset(node_offset_t reque
} }
// If for some reason we're executing a node without source, return -1. // If for some reason we're executing a node without source, return -1.
const parse_node_t &node = tree.at(requested_index); const parse_node_t &node = tree().at(requested_index);
if (!node.has_source()) { if (!node.has_source()) {
return -1; return -1;
} }
size_t char_offset = tree.at(requested_index).source_start; size_t char_offset = tree().at(requested_index).source_start;
return this->line_offset_of_character_at_offset(char_offset); return this->line_offset_of_character_at_offset(char_offset);
} }
int parse_execution_context_t::line_offset_of_character_at_offset(size_t offset) { int parse_execution_context_t::line_offset_of_character_at_offset(size_t offset) {
// Count the number of newlines, leveraging our cache. // Count the number of newlines, leveraging our cache.
assert(offset <= src.size()); assert(offset <= pstree->src.size());
// Easy hack to handle 0. // Easy hack to handle 0.
if (offset == 0) { if (offset == 0) {
@ -1459,7 +1453,7 @@ int parse_execution_context_t::line_offset_of_character_at_offset(size_t offset)
// We want to return (one plus) the number of newlines at offsets less than the given offset. // We want to return (one plus) the number of newlines at offsets less than the given offset.
// cached_lineno_count is the number of newlines at indexes less than cached_lineno_offset. // cached_lineno_count is the number of newlines at indexes less than cached_lineno_offset.
const wchar_t *str = src.c_str(); const wchar_t *str = pstree->src.c_str();
if (offset > cached_lineno_offset) { if (offset > cached_lineno_offset) {
size_t i; size_t i;
for (i = cached_lineno_offset; str[i] != L'\0' && i < offset; i++) { for (i = cached_lineno_offset; str[i] != L'\0' && i < offset; i++) {
@ -1495,7 +1489,7 @@ int parse_execution_context_t::get_current_line_number() {
int parse_execution_context_t::get_current_source_offset() const { int parse_execution_context_t::get_current_source_offset() const {
int result = -1; int result = -1;
if (executing_node_idx != NODE_OFFSET_INVALID) { if (executing_node_idx != NODE_OFFSET_INVALID) {
const parse_node_t &node = tree.at(executing_node_idx); const parse_node_t &node = tree().at(executing_node_idx);
if (node.has_source()) { if (node.has_source()) {
result = static_cast<int>(node.source_start); result = static_cast<int>(node.source_start);
} }

View file

@ -28,17 +28,16 @@ enum parse_execution_result_t {
class parse_execution_context_t { class parse_execution_context_t {
private: private:
const parse_node_tree_t tree; parsed_source_ref_t pstree;
const wcstring src;
io_chain_t block_io; io_chain_t block_io;
parser_t *const parser; parser_t *const parser;
// parse_error_list_t errors; // parse_error_list_t errors;
int eval_level; int eval_level;
// The currently executing node index, used to indicate the line number. // The currently executing node index, used to indicate the line number.
node_offset_t executing_node_idx; node_offset_t executing_node_idx = NODE_OFFSET_INVALID;
// Cached line number information. // Cached line number information.
size_t cached_lineno_offset; size_t cached_lineno_offset = 0;
int cached_lineno_count; int cached_lineno_count = 0;
// No copying allowed. // No copying allowed.
parse_execution_context_t(const parse_execution_context_t &); parse_execution_context_t(const parse_execution_context_t &);
parse_execution_context_t &operator=(const parse_execution_context_t &); parse_execution_context_t &operator=(const parse_execution_context_t &);
@ -128,8 +127,7 @@ class parse_execution_context_t {
int line_offset_of_character_at_offset(size_t char_idx); int line_offset_of_character_at_offset(size_t char_idx);
public: public:
parse_execution_context_t(parse_node_tree_t t, const wcstring &s, parser_t *p, parse_execution_context_t(parsed_source_ref_t pstree, parser_t *p, int initial_eval_level);
int initial_eval_level);
/// Returns the current eval level. /// Returns the current eval level.
int current_eval_level() const { return eval_level; } int current_eval_level() const { return eval_level; }
@ -142,7 +140,10 @@ class parse_execution_context_t {
int get_current_source_offset() const; int get_current_source_offset() const;
/// Returns the source string. /// Returns the source string.
const wcstring &get_source() const { return src; } const wcstring &get_source() const { return pstree->src; }
/// Return the parse tree.
const parse_node_tree_t &tree() const { return pstree->tree; }
/// Start executing at the given node offset. Returns 0 if there was no error, 1 if there was an /// Start executing at the given node offset. Returns 0 if there was no error, 1 if there was an
/// error. /// error.

View file

@ -1199,6 +1199,13 @@ const parse_node_t *parse_node_tree_t::get_child(const parse_node_t &parent, nod
return result; return result;
} }
parsed_source_ref_t parse_source(wcstring src, parse_tree_flags_t flags, parse_error_list_t *errors,
parse_token_type_t goal) {
parse_node_tree_t tree;
if (!parse_tree_from_string(src, flags, &tree, errors, goal)) return {};
return std::make_shared<parsed_source_t>(std::move(src), std::move(tree));
}
const parse_node_t &parse_node_tree_t::find_child(const parse_node_t &parent, const parse_node_t &parse_node_tree_t::find_child(const parse_node_t &parent,
parse_token_type_t type) const { parse_token_type_t type) const {
for (node_offset_t i = 0; i < parent.child_count; i++) { for (node_offset_t i = 0; i < parent.child_count; i++) {

View file

@ -232,6 +232,23 @@ bool parse_tree_from_string(const wcstring &str, parse_tree_flags_t flags,
parse_node_tree_t *output, parse_error_list_t *errors, parse_node_tree_t *output, parse_error_list_t *errors,
parse_token_type_t goal = symbol_job_list); parse_token_type_t goal = symbol_job_list);
/// A type wrapping up a parse tree and the original source behind it.
struct parsed_source_t {
wcstring src;
parse_node_tree_t tree;
parsed_source_t(wcstring s, parse_node_tree_t t) : src(std::move(s)), tree(std::move(t)) {}
parsed_source_t(const parsed_source_t &) = delete;
void operator=(const parsed_source_t &) = delete;
parsed_source_t(parsed_source_t &&) = default;
parsed_source_t &operator=(parsed_source_t &&) = default;
};
/// Return a shared pointer to parsed_source_t, or null on failure.
using parsed_source_ref_t = std::shared_ptr<parsed_source_t>;
parsed_source_ref_t parse_source(wcstring src, parse_tree_flags_t flags, parse_error_list_t *errors,
parse_token_type_t goal = symbol_job_list);
// Fish grammar: // Fish grammar:
// //
// # A job_list is a list of jobs, separated by semicolons or newlines // # A job_list is a list of jobs, separated by semicolons or newlines

View file

@ -1043,7 +1043,7 @@ parser_test_error_bits_t parse_util_detect_errors_in_argument(const parse_node_t
parser_test_error_bits_t parse_util_detect_errors(const wcstring &buff_src, parser_test_error_bits_t parse_util_detect_errors(const wcstring &buff_src,
parse_error_list_t *out_errors, parse_error_list_t *out_errors,
bool allow_incomplete, bool allow_incomplete,
parse_node_tree_t *out_tree) { parsed_source_ref_t *out_pstree) {
parse_node_tree_t node_tree; parse_node_tree_t node_tree;
parse_error_list_t parse_errors; parse_error_list_t parse_errors;
@ -1291,8 +1291,8 @@ parser_test_error_bits_t parse_util_detect_errors(const wcstring &buff_src,
*out_errors = std::move(parse_errors); *out_errors = std::move(parse_errors);
} }
if (out_tree != NULL) { if (out_pstree != NULL) {
*out_tree = std::move(node_tree); *out_pstree = std::make_shared<parsed_source_t>(buff_src, std::move(node_tree));
} }
return res; return res;

View file

@ -7,7 +7,7 @@
#include <vector> #include <vector>
#include "common.h" #include "common.h"
#include "parse_constants.h" #include "parse_tree.h"
#include "tokenizer.h" #include "tokenizer.h"
/// Find the beginning and end of the first subshell in the specified string. /// Find the beginning and end of the first subshell in the specified string.
@ -124,12 +124,12 @@ std::vector<int> parse_util_compute_indents(const wcstring &src);
/// Given a string, detect parse errors in it. If allow_incomplete is set, then if the string is /// Given a string, detect parse errors in it. If allow_incomplete is set, then if the string is
/// incomplete (e.g. an unclosed quote), an error is not returned and the PARSER_TEST_INCOMPLETE bit /// incomplete (e.g. an unclosed quote), an error is not returned and the PARSER_TEST_INCOMPLETE bit
/// is set in the return value. If allow_incomplete is not set, then incomplete strings result in an /// is set in the return value. If allow_incomplete is not set, then incomplete strings result in an
/// error. If out_tree is not NULL, the resulting tree is returned by reference. /// error. If out_pstree is not NULL, the resulting tree is returned by reference.
class parse_node_tree_t; class parse_node_tree_t;
parser_test_error_bits_t parse_util_detect_errors(const wcstring &buff_src, parser_test_error_bits_t parse_util_detect_errors(const wcstring &buff_src,
parse_error_list_t *out_errors = NULL, parse_error_list_t *out_errors = NULL,
bool allow_incomplete = true, bool allow_incomplete = true,
parse_node_tree_t *out_tree = NULL); parsed_source_ref_t *out_pstree = NULL);
/// Test if this argument contains any errors. Detected errors include syntax errors in command /// Test if this argument contains any errors. Detected errors include syntax errors in command
/// substitutions, improperly escaped characters and improper use of the variable expansion /// substitutions, improperly escaped characters and improper use of the variable expansion

View file

@ -641,11 +641,11 @@ profile_item_t *parser_t::create_profile_item() {
return result; return result;
} }
int parser_t::eval(const wcstring &cmd, const io_chain_t &io, enum block_type_t block_type) { int parser_t::eval(wcstring cmd, const io_chain_t &io, enum block_type_t block_type) {
// Parse the source into a tree, if we can. // Parse the source into a tree, if we can.
parse_node_tree_t tree;
parse_error_list_t error_list; parse_error_list_t error_list;
if (!parse_tree_from_string(cmd, parse_flag_none, &tree, &error_list)) { parsed_source_ref_t ps = parse_source(cmd, parse_flag_none, &error_list);
if (!ps) {
// Get a backtrace. This includes the message. // Get a backtrace. This includes the message.
wcstring backtrace_and_desc; wcstring backtrace_and_desc;
this->get_backtrace(cmd, error_list, backtrace_and_desc); this->get_backtrace(cmd, error_list, backtrace_and_desc);
@ -654,15 +654,14 @@ int parser_t::eval(const wcstring &cmd, const io_chain_t &io, enum block_type_t
fwprintf(stderr, L"%ls\n", backtrace_and_desc.c_str()); fwprintf(stderr, L"%ls\n", backtrace_and_desc.c_str());
return 1; return 1;
} }
return this->eval(cmd, io, block_type, std::move(tree)); return this->eval(ps, io, block_type);
} }
int parser_t::eval(const wcstring &cmd, const io_chain_t &io, enum block_type_t block_type, int parser_t::eval(parsed_source_ref_t ps, const io_chain_t &io, enum block_type_t block_type) {
parse_node_tree_t tree) {
CHECK_BLOCK(1); CHECK_BLOCK(1);
assert(block_type == TOP || block_type == SUBST); assert(block_type == TOP || block_type == SUBST);
if (tree.empty()) { if (ps->tree.empty()) {
return 0; return 0;
} }
@ -674,8 +673,7 @@ int parser_t::eval(const wcstring &cmd, const io_chain_t &io, enum block_type_t
(execution_contexts.empty() ? -1 : execution_contexts.back()->current_eval_level()); (execution_contexts.empty() ? -1 : execution_contexts.back()->current_eval_level());
// Append to the execution context stack. // Append to the execution context stack.
execution_contexts.push_back( execution_contexts.push_back(make_unique<parse_execution_context_t>(ps, this, exec_eval_level));
make_unique<parse_execution_context_t>(std::move(tree), cmd, this, exec_eval_level));
const parse_execution_context_t *ctx = execution_contexts.back().get(); const parse_execution_context_t *ctx = execution_contexts.back().get();
// Execute the first node. // Execute the first node.

View file

@ -246,11 +246,10 @@ class parser_t {
/// \param block_type The type of block to push on the block stack /// \param block_type The type of block to push on the block stack
/// ///
/// \return 0 on success, 1 otherwise /// \return 0 on success, 1 otherwise
int eval(const wcstring &cmd, const io_chain_t &io, enum block_type_t block_type); int eval(wcstring cmd, const io_chain_t &io, enum block_type_t block_type);
/// Evaluate the expressions contained in cmd, which has been parsed into the given parse tree. /// Evaluate the parsed source ps.
int eval(const wcstring &cmd, const io_chain_t &io, enum block_type_t block_type, int eval(parsed_source_ref_t ps, const io_chain_t &io, enum block_type_t block_type);
parse_node_tree_t t);
/// Evaluates a block node at the given node offset in the topmost execution context. /// Evaluates a block node at the given node offset in the topmost execution context.
int eval_block_node(node_offset_t node_idx, const io_chain_t &io, enum block_type_t block_type); int eval_block_node(node_offset_t node_idx, const io_chain_t &io, enum block_type_t block_type);

View file

@ -3316,9 +3316,10 @@ static int read_ni(int fd, const io_chain_t &io) {
} }
parse_error_list_t errors; parse_error_list_t errors;
parse_node_tree_t tree; parsed_source_ref_t pstree;
if (!parse_util_detect_errors(str, &errors, false /* do not accept incomplete */, &tree)) { if (!parse_util_detect_errors(str, &errors, false /* do not accept incomplete */,
parser.eval(str, io, TOP, std::move(tree)); &pstree)) {
parser.eval(pstree, io, TOP);
} else { } else {
wcstring sb; wcstring sb;
parser.get_backtrace(str, errors, sb); parser.get_backtrace(str, errors, sb);