Lines Matching defs:convs
499 conversion **convs;
2177 size_t num_convs, conversion **convs,
2188 cand->convs = convs;
2198 if (convs && cand->reversed ())
2201 std::swap (convs[0], convs[1]);
2323 conversion **convs,
2355 if (!convs)
2356 convs = alloc_conversions (len);
2450 if (convs[i])
2489 convs[i] = t;
2509 return add_candidate (candidates, fn, orig_first_arg, args, len, convs,
2534 conversion **convs;
2542 convs = alloc_conversions (len);
2586 convs[i] = t;
2612 return add_candidate (candidates, totype, obj, arglist, len, convs,
2622 conversion **convs;
2632 convs = alloc_conversions (num_convs);
2661 convs[i] = t;
2667 convs[2] = convs[1];
2668 convs[1] = convs[0];
2673 convs[0] = t;
2684 num_convs, convs,
3296 tree convs;
3301 convs = lookup_conversions (argtypes[i]);
3311 else if (! convs)
3314 for (; convs; convs = TREE_CHAIN (convs))
3316 type = TREE_TYPE (convs);
3414 conversion **convs = NULL;
3529 convs = alloc_conversions (nargs);
3545 convs[0] = t;
3558 return_type, strict, flags, convs,
3601 conversion_path, flags, convs,
3629 return add_candidate (candidates, tmpl, first_arg, arglist, nargs, convs,
3868 candidate->convs[0]->type,
3869 candidate->convs[1]->type,
3870 candidate->convs[2]->type);
3873 candidate->convs[0]->type,
3874 candidate->convs[1]->type);
3877 candidate->convs[0]->type);
5005 tree fns, convs, first_mem_arg = NULL_TREE;
5061 convs = lookup_conversions (type);
5063 for (; convs; convs = TREE_CHAIN (convs))
5065 tree totype = TREE_TYPE (convs);
5071 for (tree fn : ovl_range (TREE_VALUE (convs)))
5123 obj = convert_like_with_context (cand->convs[0], obj, cand->fn,
5128 obj = convert_like (cand->convs[0], obj, complain);
5774 conv = cand->convs[0];
5776 conv = cand->convs[1];
5779 conv = cand->convs[2];
6033 if (!perfect_conversion_p (cand->convs[i]))
6047 if (!cand->convs[i])
6716 std::swap (cand->convs[0], cand->convs[1]);
6854 conversion *conv = cand->convs[0];
6863 conv = cand->convs[1];
6873 conv = cand->convs[2];
7745 maybe_print_user_conv_context (conversion *convs)
7747 if (convs->user_conv_p)
7748 for (conversion *t = convs; t; t = next_conversion (t))
7824 /* Perform the conversions in CONVS on the expression EXPR. FN and
7835 convert_like_internal (conversion *convs, tree expr, tree fn, int argnum,
7839 tree totype = convs->type;
7844 if (convs->bad_p && !(complain & tf_error))
7847 if (convs->bad_p
7848 && convs->kind != ck_user
7849 && convs->kind != ck_list
7850 && convs->kind != ck_ambig
7851 && (convs->kind != ck_ref_bind
7852 || (convs->user_conv_p && next_conversion (convs)->bad_p))
7853 && (convs->kind != ck_rvalue
7855 && convs->kind != ck_base)
7858 conversion *t = convs;
7894 if (convs->kind == ck_ref_bind)
7935 switch (convs->kind)
7939 struct z_candidate *cand = convs->cand;
7954 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr) || convs->need_temporary_p)
8011 if (convs->check_narrowing && expr != error_mark_node)
8028 expr = mark_use (expr, /*rvalue_p=*/!convs->rvaluedness_matches_p,
8048 int flags = (convs->need_temporary_p
8050 build_user_type_conversion (totype, convs->u.expr, flags, complain);
8072 tree sub = convert_like (convs->u.list[ix], val, fn,
8138 conversion *nc = next_conversion (convs);
8139 if (convs->kind == ck_ref_bind && nc->kind == ck_qual
8140 && !convs->need_temporary_p)
8147 convs->kind == ck_ref_bind
8153 switch (convs->kind)
8162 maybe_print_user_conv_context (convs);
8185 if (convs->kind == ck_base && !convs->need_temporary_p)
8202 if (convs->user_conv_p)
8208 if (convs->copy_init_p)
8210 if (convs->rvaluedness_matches_p)
8217 maybe_print_user_conv_context (convs);
8227 if (convs->bad_p && !next_conversion (convs)->bad_p)
8238 conversion *next = next_conversion (convs);
8271 maybe_print_user_conv_context (convs);
8277 maybe_warn_array_conv (loc, convs, expr);
8285 if (convs->need_temporary_p
8296 gcc_assert (similar_type_p (type, next_conversion (convs)->type));
8374 maybe_warn_array_conv (loc, convs, expr);
8379 if (convs->base_p)
8392 if (convs->check_narrowing
8394 convs->check_narrowing_const_only))
8431 convert_like (conversion *convs, tree expr, tree fn, int argnum,
8442 && convs->kind != ck_identity
8443 && conv_unsafe_in_template_p (convs->type, TREE_TYPE (expr)))
8445 conv_expr = build1 (IMPLICIT_CONV_EXPR, convs->type, expr);
8446 if (convs->kind != ck_ref_bind)
8448 if (!convs->bad_p)
8454 expr = convert_like_internal (convs, expr, fn, argnum,
8464 convert_like (conversion *convs, tree expr, tsubst_flags_t complain)
8466 return convert_like (convs, expr, NULL_TREE, 0,
8474 convert_like_with_context (conversion *convs, tree expr, tree fn, int argnum,
8477 return convert_like (convs, expr, fn, argnum,
9211 conversion **convs = cand->convs;
9308 && conv_binds_ref_to_prvalue (convs[0]))
9439 tree ptype = convs[0]->type;
9445 || CONVERSION_RANK (convs[0]) > cr_exact)
9460 if (convs[i]->bad_p)
9553 conv = convs[i];
9686 && cand->convs[cand->num_convs-1]->ellipsis_p)
9754 || convs[0]->need_temporary_p
9823 && conv_binds_ref_to_prvalue (convs[1]))
11963 conversion *conv = cand->convs[0];
12126 conversion *t1 = cand1->convs[i + off1];
12127 conversion *t2 = cand2->convs[i + off2];
12223 tree source = source_type (w->convs[0]);
12371 conversion *t1 = cand1->convs[i + off1];
12372 conversion *t2 = cand2->convs[i + off2];
12395 if (!same_type_p (cand1->convs[i]->type,
12396 cand2->convs[i]->type))
12515 if (CONVERSION_RANK (cand1->convs[i+off1]) > rank1)
12516 rank1 = CONVERSION_RANK (cand1->convs[i+off1]);
12517 if (CONVERSION_RANK (cand2->convs[i + off2]) > rank2)
12518 rank2 = CONVERSION_RANK (cand2->convs[i + off2]);
Indexes created Sun Mar 01 05:31:48 UTC 2026