Lines Matching refs:cs

497   struct cgraph_edge *cs;
501 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
502 sum += cs->count;
517 struct cgraph_edge *cs;
530 for (cs = node->callees; cs; cs = cs->next_callee)
532 ipa_callsite_compute_count (cs);
533 if (ipa_callsite_param_count (cs)
534 != ipa_method_formal_count (cs->callee))
538 ipa_callsite_param_count_set (cs, 0);
539 ipa_method_formal_count_set (cs->callee, 0);
542 ipa_callsite_compute_param (cs);
579 struct cgraph_edge *cs;
591 for (cs = mt->callees; cs; cs = cs->next_callee)
593 callee = ipa_callsite_callee (cs);
594 count = ipa_callsite_param_count (cs);
597 jump_func = ipa_callsite_param (cs, i);
641 struct cgraph_edge *cs;
649 for (cs = node->callees; cs; cs = cs->next_callee)
652 fprintf (f, "-> %s :: \n", cgraph_node_name (cs->callee));
653 count = ipa_callsite_param_count (cs);
656 jump_func = ipa_callsite_param (cs, i);
714 struct cgraph_edge *cs;
718 for (cs = node->callees; cs; cs = cs->next_callee)
720 fprintf (f, "%s -> %s ", cgraph_node_name (cs->caller),
721 cgraph_node_name (cs->callee));
723 (HOST_WIDE_INT) cs->count);
889 ipcp_redirect (struct cgraph_edge *cs)
897 caller = cs->caller;
898 callee = cs->callee;
907 jump_func = ipa_callsite_param (cs, i);
923 struct cgraph_edge *cs;
930 for (cs = node->callees; cs; cs = cs->next_callee)
931 if (ipcp_method_is_cloned (cs->callee))
934 orig_callee = ipcp_method_orig_node (cs->callee);
935 if (ipcp_redirect (cs))
937 cgraph_redirect_edge_callee (cs, orig_callee);
939 (get_call_expr_in (cs->call_stmt), 0), 0) =
976 struct cgraph_edge *cs;
988 for (cs = node->callees; cs; cs = cs->next_callee)
989 cs->count = cs->count * scale / REG_BR_PROB_BASE;
990 for (cs = orig_node->callees; cs; cs = cs->next_callee)
991 cs->count = cs->count * scale_complement / REG_BR_PROB_BASE;
1010 struct cgraph_edge *cs;
1047 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
1050 for (cs = node->callers; cs != NULL; cs = cs->next_caller)
1051 VEC_quick_push (cgraph_edge_p, redirect_callers, cs);