lhs_type_descriptor,
TREE_TYPE(rhs_type_descriptor),
rhs_type_descriptor);
+ if (call == error_mark_node)
+ return error_mark_node;
// This will panic if the interface conversion fails.
TREE_NOTHROW(assert_interface_decl) = 0;
elt->value = fold_convert_loc(location, TREE_TYPE(field), call);
lhs_type_descriptor,
TREE_TYPE(rhs_type_descriptor),
rhs_type_descriptor);
+ if (call == error_mark_node)
+ return error_mark_node;
// This will panic if the interface conversion fails.
TREE_NOTHROW(convert_interface_decl) = 0;
elt->value = fold_convert_loc(location, TREE_TYPE(field), call);
rhs_type_descriptor,
TREE_TYPE(rhs_inter_descriptor),
rhs_inter_descriptor);
+ if (call == error_mark_node)
+ return error_mark_node;
// This call will panic if the conversion is invalid.
TREE_NOTHROW(check_interface_type_decl) = 0;
descriptor,
ptr_type_node,
arg);
+ if (left_tree == error_mark_node)
+ return error_mark_node;
// This can panic if the type is not comparable.
TREE_NOTHROW(empty_interface_value_compare_decl) = 0;
}
descriptor,
ptr_type_node,
arg);
+ if (left_tree == error_mark_node)
+ return error_mark_node;
// This can panic if the type is not comparable.
TREE_NOTHROW(interface_value_compare_decl) = 0;
}
left_tree,
TREE_TYPE(right_tree),
right_tree);
+ if (left_tree == error_mark_node)
+ return error_mark_node;
// This can panic if the type is uncomparable.
TREE_NOTHROW(empty_interface_compare_decl) = 0;
}
left_tree,
TREE_TYPE(right_tree),
right_tree);
+ if (left_tree == error_mark_node)
+ return error_mark_node;
// This can panic if the type is uncomparable.
TREE_NOTHROW(interface_compare_decl) = 0;
}
"__go_print_space",
0,
void_type_node);
+ if (call == error_mark_node)
+ return error_mark_node;
append_to_statement_list(call, &stmt_list);
}
void_type_node,
TREE_TYPE(arg),
arg);
- if (call != error_mark_node)
- append_to_statement_list(call, &stmt_list);
+ if (call == error_mark_node)
+ return error_mark_node;
+ append_to_statement_list(call, &stmt_list);
}
}
"__go_print_nl",
0,
void_type_node);
+ if (call == error_mark_node)
+ return error_mark_node;
append_to_statement_list(call, &stmt_list);
}
void_type_node,
TREE_TYPE(arg_tree),
arg_tree);
+ if (call == error_mark_node)
+ return error_mark_node;
// This function will throw an exception.
TREE_NOTHROW(panic_fndecl) = 0;
// This function will not return.
0,
empty_tree);
}
+ if (call == error_mark_node)
+ return error_mark_node;
return fold_build3_loc(location, COND_EXPR, empty_tree, arg_tree,
call, empty_nil_tree);
}
start_tree,
length_type,
end_tree);
+ if (ret == error_mark_node)
+ return error_mark_node;
// This will panic if the bounds are out of range for the
// string.
TREE_NOTHROW(strslice_fndecl) = 0;
(insert
? boolean_true_node
: boolean_false_node));
+ if (call == error_mark_node)
+ return error_mark_node;
// This can panic on a map of interface type if the interface holds
// an uncomparable or unhashable type.
TREE_NOTHROW(map_index_fndecl) = 0;
TYPE_SIZE_UNIT(TREE_TYPE(val_field)),
const_ptr_type_node,
fold_convert(const_ptr_type_node, valaddr));
+ if (call == error_mark_node)
+ return error_mark_node;
tree ret;
if (make_tmp == NULL)
void_type_node,
build_pointer_type(root_list_type),
build_fold_addr_expr(decl));
- append_to_statement_list(call, init_stmt_list);
+ if (call != error_mark_node)
+ append_to_statement_list(call, init_stmt_list);
}
// Build the decl for the initialization function.
void_type_node,
ptr_type_node,
this->defer_stack(end_loc));
- append_to_statement_list(call, &stmt_list);
+ if (call != error_mark_node)
+ append_to_statement_list(call, &stmt_list);
tree retval = this->return_value(gogo, named_function, end_loc, &stmt_list);
tree set;
void_type_node,
ptr_type_node,
this->defer_stack(end_loc));
- TREE_NOTHROW(undefer_fndecl) = 0;
+ if (undefer_fndecl != NULL_TREE)
+ TREE_NOTHROW(undefer_fndecl) = 0;
tree defer = Gogo::call_builtin(&check_fndecl,
end_loc,
void_type_node,
integer_type_node,
build_int_cst(integer_type_node, code));
+ if (ret == error_mark_node)
+ return error_mark_node;
// The runtime error function panics and does not return.
TREE_NOTHROW(runtime_error_fndecl) = 0;
TREE_THIS_VOLATILE(runtime_error_fndecl) = 1;
(for_select
? boolean_true_node
: boolean_false_node));
+ if (ret == error_mark_node)
+ return error_mark_node;
// This can panic if there are too many operations on a
// closed channel.
TREE_NOTHROW(send_small_fndecl) = 0;
channel,
uint64_type_node,
val);
+ if (ret == error_mark_node)
+ return error_mark_node;
// This can panic if there are too many operations on a
// closed channel.
TREE_NOTHROW(send_nonblocking_small_fndecl) = 0;
(for_select
? boolean_true_node
: boolean_false_node));
+ if (call == error_mark_node)
+ return error_mark_node;
// This can panic if there are too many operations on a
// closed channel.
TREE_NOTHROW(send_big_fndecl) = 0;
channel,
ptr_type_node,
val);
+ if (call == error_mark_node)
+ return error_mark_node;
// This can panic if there are too many operations on a
// closed channel.
TREE_NOTHROW(send_nonblocking_big_fndecl) = 0;
(for_select
? boolean_true_node
: boolean_false_node));
+ if (call == error_mark_node)
+ return error_mark_node;
// This can panic if there are too many operations on a closed
// channel.
TREE_NOTHROW(receive_small_fndecl) = 0;
(for_select
? boolean_true_node
: boolean_false_node));
+ if (call == error_mark_node)
+ return error_mark_node;
// This can panic if there are too many operations on a closed
// channel.
TREE_NOTHROW(receive_big_fndecl) = 0;
ptr_type_node,
fold_convert_loc(location, ptr_type_node,
closure));
+ if (x == error_mark_node)
+ return error_mark_node;
x = save_expr(x);