Lines Matching refs:cand2
2458 struct z_candidate **cand2;
2471 cand2 = &cand1->next;
2472 while (*cand2)
2474 if (TREE_CODE ((*cand2)->fn) == FUNCTION_DECL
2475 && equal_functions (fn, (*cand2)->fn))
2476 *cand2 = (*cand2)->next;
2478 cand2 = &(*cand2)->next;
6094 1: cand1 is better than cand2
6095 -1: cand2 is better than cand1
6096 0: cand1 and cand2 are indistinguishable */
6099 joust (struct z_candidate *cand1, struct z_candidate *cand2, bool warn)
6108 if (cand1->viable > cand2->viable)
6110 if (cand1->viable < cand2->viable)
6115 if (cand1->fn == cand2->fn
6132 if (len != cand2->num_convs)
6135 int static_2 = DECL_STATIC_FUNCTION_P (cand2->fn);
6151 conversion *t2 = cand2->convs[i + off2];
6174 w = cand1, l = cand2;
6177 w = cand2, l = cand1;
6202 && (!DECL_CONSTRUCTOR_P (cand1->fn) || !DECL_CONSTRUCTOR_P (cand2->fn))
6203 && winner != compare_ics (cand1->second_conv, cand2->second_conv))
6209 w = cand1, l = cand2;
6211 w = cand2, l = cand1;
6256 if (!cand1->template_decl && cand2->template_decl)
6258 else if (cand1->template_decl && !cand2->template_decl)
6266 if (cand1->template_decl && cand2->template_decl)
6270 TI_TEMPLATE (cand2->template_decl),
6290 winner = compare_ics (cand1->second_conv, cand2->second_conv);
6307 || TREE_CODE (cand2->fn) == IDENTIFIER_NODE)
6311 cand2->convs[i]->type))
6315 if (cand1->fn == cand2->fn)
6319 /* cand1 is built-in; prefer cand2. */
6322 /* cand2 is built-in; prefer cand1. */
6329 if (DECL_P (cand1->fn) && DECL_P (cand2->fn)
6330 && equal_functions (cand1->fn, cand2->fn))
6346 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
6347 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
6350 winner = 1, w = cand1, l = cand2;
6352 winner = -1, w = cand2, l = cand1;