registered_function &
function_builder::add_function (const function_instance &instance,
const char *name, tree fntype, tree attrs,
- bool placeholder_p, const char *overload_name,
+ const char *overload_name,
const vec<tree> &argument_types,
enum required_ext required,
bool overloaded_p = false)
nodes and remove the target hook. For now, however, we need to appease the
validation and return a non-NULL, non-error_mark_node node, so we
arbitrarily choose integer_zero_node. */
- tree decl = placeholder_p || in_lto_p
+ tree decl = in_lto_p
? integer_zero_node
: simulate_builtin_function_decl (input_location, name, fntype,
code, NULL, attrs);
argument_types.address ());
tree attrs = get_attributes (instance);
registered_function &rfn
- = add_function (instance, name, fntype, attrs, false, overload_name,
+ = add_function (instance, name, fntype, attrs, overload_name,
argument_types.copy (), required);
/* Enter the function into the hash table. */
/* Attribute lists shouldn't be shared. */
tree attrs = get_attributes (instance);
if (m_direct_overloads)
- add_function (instance, overload_name, fntype, attrs, false, NULL,
+ add_function (instance, overload_name, fntype, attrs, NULL,
vNULL, required);
else
{
/* To avoid API conflicting, take void return type and void argument
for the overloaded function. */
tree fntype = build_function_type (void_type_node, void_list_node);
- add_function (instance, name, fntype, NULL_TREE, false, name,
+ add_function (instance, name, fntype, NULL_TREE, name,
vNULL, required, true);
obstack_free (&m_string_obstack, name);
}