Home
last modified time | relevance | path

Searched refs:curr_call (Results 1 – 2 of 2) sorted by relevance

/dports/devel/libfirm/libfirm-1.21.0/ir/opt/
H A Dopt_inline.c1537 list_for_each_entry(call_entry, curr_call, &env->calls, list) { in inline_into()
1538 assert(is_Call(curr_call->call)); in inline_into()
1539 maybe_push_call(pqueue, curr_call, inline_threshold); in inline_into()
1546 ir_graph *callee = curr_call->callee; in inline_into()
1547 ir_node *call_node = curr_call->call; in inline_into()
1564 int benefice = curr_call->benefice; in inline_into()
1569 if (!curr_call->all_const) in inline_into()
1587 int benefice = curr_call->benefice; in inline_into()
1594 if (!curr_call->all_const) in inline_into()
1649 list_del(&curr_call->list); in inline_into()
[all …]
/dports/math/libpgmath/flang-d07daf3/tools/flang1/flang1exe/
H A Dast.c3973 } curr_call = {0, 0, 0, 0, 0}; variable
3985 if (curr_call.arg_num < curr_call.arg_count) in begin_call()
3988 curr_call.arg_count = count; in begin_call()
3990 curr_call.ast_type = ast_type; in begin_call()
3993 A_LOPP(curr_call.ast, lop); in begin_call()
3995 A_ARGSP(curr_call.ast, curr_call.argt); in begin_call()
3999 curr_call.arg_num = 0; in begin_call()
4001 return curr_call.ast; in begin_call()
4010 if (curr_call.arg_num >= curr_call.arg_count) in add_arg()
4014 ARGT_ARG(curr_call.argt, curr_call.arg_num) = arg; in add_arg()
[all …]