Searched refs:cand2 (Results 1 – 4 of 4) sorted by relevance
533 const remat_candidate *cand2) in equal() argument535 return (cand1->regno == cand2->regno in equal()536 && cand1->constant_p == cand2->constant_p in equal()538 ? rtx_equal_p (cand1->remat_rtx, cand2->remat_rtx) in equal()539 : rtx_equal_p_cb (cand1->remat_rtx, cand2->remat_rtx, in equal()541 && (!cand1->uses || bitmap_equal_p (cand1->uses, cand2->uses))); in equal()1103 remat_candidate *cand2 = &m_candidates[cand2_index]; in record_equiv_candidates() local1104 gcc_checking_assert (!cand2->equiv_class); in record_equiv_candidates()1116 cand2->equiv_class = ec; in record_equiv_candidates()1462 remat_candidate *cand2 = &m_candidates[cand2_index]; in decide_candidate_validity() local[all …]
502 opt_scalar_float_mode cand1, cand2; in default_floatn_mode() local517 cand2 = TFmode; in default_floatn_mode()533 if (cand2.exists (&mode) in default_floatn_mode()537 return cand2; in default_floatn_mode()
194 cand_eq_p (const void *cand1, const void *cand2) in cand_eq_p() argument197 const_cand_t c2 = (const_cand_t) cand2; in cand_eq_p()
3975 struct z_candidate **cand2; in print_z_candidates() local3982 for (cand2 = &cand1; *cand2; ) in print_z_candidates()3984 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL in print_z_candidates()3985 && !(*cand2)->viable in print_z_candidates()3986 && DECL_DELETED_FN ((*cand2)->fn)) in print_z_candidates()3987 *cand2 = (*cand2)->next; in print_z_candidates()3989 cand2 = &(*cand2)->next; in print_z_candidates()4006 cand2 = &cand1->next; in print_z_candidates()4007 while (*cand2) in print_z_candidates()4009 if (DECL_P ((*cand2)->fn) in print_z_candidates()[all …]