// given a new lambda_info with static parameter values, make a copy
// of the tree with declared types evaluated and static parameters passed
// on to all enclosed functions.
// this tree can then be further mutated by optimization passes.
DLLEXPORT
jl_value_t *jl_prepare_ast(jl_lambda_info_t *li, jl_tuple_t *sparams)
{
jl_tuple_t *spenv = NULL;
jl_value_t *ast = li->ast;
if (ast == NULL) return NULL;
JL_GC_PUSH(&spenv, &ast);
spenv = jl_tuple_tvars_to_symbols(sparams);
if (!jl_is_expr(ast)) {
ast = jl_uncompress_ast(li, ast);
ast = dont_copy_ast(ast, sparams, 1);
}
else {
ast = copy_ast(ast, sparams, 1);
}
jl_module_t *last_m = jl_current_module;
JL_TRY {
jl_current_module = li->module;
eval_decl_types(jl_lam_vinfo((jl_expr_t*)ast), spenv);
eval_decl_types(jl_lam_capt((jl_expr_t*)ast), spenv);
}
JL_CATCH {
jl_current_module = last_m;
jl_rethrow();
}
jl_current_module = last_m;
JL_GC_POP();
return ast;
}
DLLEXPORT
jl_value_t *jl_compress_ast(jl_value_t *ast)
{
ios_t dest;
jl_ios_mem(&dest, 0);
int en = jl_gc_is_enabled();
jl_gc_disable();
tree_literal_values = jl_alloc_cell_1d(0);
jl_serialize_value(&dest, ast);
//ios_printf(ios_stderr, "%d bytes, %d values\n", dest.size, vals->length);
jl_value_t *v = (jl_value_t*)jl_takebuf_array(&dest);
if (tree_literal_values->length == 0)
tree_literal_values = (jl_array_t*)jl_an_empty_cell;
v = (jl_value_t*)jl_tuple(4, v, tree_literal_values,
jl_lam_body((jl_expr_t*)ast)->etype,
jl_lam_capt((jl_expr_t*)ast));
tree_literal_values = NULL;
if (en)
jl_gc_enable();
return v;
}
DLLEXPORT
jl_value_t *jl_compress_ast(jl_lambda_info_t *li, jl_value_t *ast)
{
ios_t dest;
ios_mem(&dest, 0);
int en = jl_gc_is_enabled();
jl_gc_disable();
if (li->roots == NULL)
li->roots = jl_alloc_cell_1d(0);
tree_literal_values = li->roots;
jl_serialize_value(&dest, ast);
//JL_PRINTF(JL_STDERR, "%d bytes, %d values\n", dest.size, vals->length);
jl_value_t *v = (jl_value_t*)jl_takebuf_array(&dest);
if (jl_array_len(tree_literal_values) == 0) {
tree_literal_values = (jl_array_t*)jl_an_empty_cell;
li->roots = NULL;
}
v = (jl_value_t*)jl_tuple(4, v, tree_literal_values,
jl_lam_body((jl_expr_t*)ast)->etype,
jl_lam_capt((jl_expr_t*)ast));
tree_literal_values = NULL;
if (en)
jl_gc_enable();
return v;
}
// given a new lambda_info with static parameter values, make a copy
// of the tree with declared types evaluated and static parameters passed
// on to all enclosed functions.
// this tree can then be further mutated by optimization passes.
DLLEXPORT
jl_value_t *jl_prepare_ast(jl_lambda_info_t *li, jl_tuple_t *sparams)
{
jl_tuple_t *spenv = NULL;
jl_value_t *l_ast = li->ast;
if (l_ast == NULL) return NULL;
jl_value_t *ast = l_ast;
JL_GC_PUSH(&spenv, &ast);
if (jl_is_tuple(ast))
ast = jl_uncompress_ast((jl_tuple_t*)ast);
spenv = jl_tuple_tvars_to_symbols(sparams);
ast = copy_ast(ast, sparams);
eval_decl_types(jl_lam_vinfo((jl_expr_t*)ast), spenv);
eval_decl_types(jl_lam_capt((jl_expr_t*)ast), spenv);
JL_GC_POP();
return ast;
}
