Home
last modified time | relevance | path

Searched refs:cands (Results 1 – 13 of 13) sorted by relevance

/netbsd/external/gpl3/gcc.old/dist/gcc/cp/
H A Dconstraint.cc277 tree cands = NULL_TREE; in resolve_function_concept_overload() local
305 cands = tree_cons (subst, fn, cands); in resolve_function_concept_overload()
310 if (!cands) in resolve_function_concept_overload()
313 else if (TREE_CHAIN (cands)) in resolve_function_concept_overload()
317 return cands; in resolve_function_concept_overload()
H A Dpt.c28910 tree cands = NULL_TREE; in ctor_deduction_guides_for() local
28919 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
28927 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
28935 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
28938 return cands; in ctor_deduction_guides_for()
28994 cands = lookup_add (*it, cands); in deduction_guides_for()
28997 cache->value = cands; in deduction_guides_for()
28998 return cands; in deduction_guides_for()
29117 cands = pruned; in do_class_deduction()
29123 cands = lookup_add (guide, cands); in do_class_deduction()
[all …]
H A Dcall.c3543 splice_viable (struct z_candidate *cands, in splice_viable() argument
3561 cand = &cands; in splice_viable()
3577 *last_viable = cands; in splice_viable()
3578 cands = viable; in splice_viable()
3598 return viable ? viable : cands; in splice_viable()
3602 any_strictly_viable (struct z_candidate *cands) in any_strictly_viable() argument
3604 for (; cands; cands = cands->next) in any_strictly_viable()
3605 if (cands->viable == 1) in any_strictly_viable()
/netbsd/external/gpl3/gcc/dist/gcc/
H A Dtree-ssa-loop-ivopts.c677 bitmap cands; variable
6145 bitmap_clear_bit (ivs->cands, cid); in iv_ca_set_no_cp()
6203 bitmap_set_bit (ivs->cands, cid); in iv_ca_set_cp()
6235 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_add_group()
6414 nw->cands = BITMAP_ALLOC (NULL); in iv_ca_new()
6433 BITMAP_FREE ((*ivs)->cands); in iv_ca_free()
6575 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, ci, bi) in iv_ca_narrow()
6655 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_prune()
6733 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_replace()
7154 EXECUTE_IF_SET_IN_BITMAP (set->cands, 0, i, bi) in create_new_ivs()
[all …]
H A Dtree-ssa-loop-ivopts.cc678 bitmap cands; member in iv_ca
6275 bitmap_clear_bit (ivs->cands, cid); in iv_ca_set_no_cp()
6333 bitmap_set_bit (ivs->cands, cid); in iv_ca_set_cp()
6365 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_add_group()
6544 nw->cands = BITMAP_ALLOC (NULL); in iv_ca_new()
6563 BITMAP_FREE ((*ivs)->cands); in iv_ca_free()
6705 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, ci, bi) in iv_ca_narrow()
6785 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_prune()
6863 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_replace()
7284 EXECUTE_IF_SET_IN_BITMAP (set->cands, 0, i, bi) in create_new_ivs()
[all …]
H A DChangeLog.tree-ssa6722 (expr_phi_insertion): Insert on PHI's of VUSES for loadpre cands.
H A DChangeLog-2014557 cands.
/netbsd/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-loop-ivopts.c677 bitmap cands; variable
6145 bitmap_clear_bit (ivs->cands, cid); in iv_ca_set_no_cp()
6203 bitmap_set_bit (ivs->cands, cid); in iv_ca_set_cp()
6235 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_add_group()
6414 nw->cands = BITMAP_ALLOC (NULL); in iv_ca_new()
6433 BITMAP_FREE ((*ivs)->cands); in iv_ca_free()
6575 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, ci, bi) in iv_ca_narrow()
6655 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_prune()
6733 EXECUTE_IF_SET_IN_BITMAP (ivs->cands, 0, i, bi) in iv_ca_replace()
7154 EXECUTE_IF_SET_IN_BITMAP (set->cands, 0, i, bi) in create_new_ivs()
[all …]
/netbsd/external/gpl3/gcc/dist/gcc/cp/
H A Dconstraint.cc303 tree cands = NULL_TREE; in resolve_function_concept_overload() local
331 cands = tree_cons (subst, fn, cands); in resolve_function_concept_overload()
336 if (!cands) in resolve_function_concept_overload()
339 else if (TREE_CHAIN (cands)) in resolve_function_concept_overload()
343 return cands; in resolve_function_concept_overload()
H A Dpt.c28910 tree cands = NULL_TREE; in ctor_deduction_guides_for() local
28919 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
28927 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
28935 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
28938 return cands; in ctor_deduction_guides_for()
28994 cands = lookup_add (*it, cands); in deduction_guides_for()
28997 cache->value = cands; in deduction_guides_for()
28998 return cands; in deduction_guides_for()
29117 cands = pruned; in do_class_deduction()
29123 cands = lookup_add (guide, cands); in do_class_deduction()
[all …]
H A Dpt.cc29982 tree cands = NULL_TREE; in ctor_deduction_guides_for() local
29991 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
29999 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
30007 cands = lookup_add (guide, cands); in ctor_deduction_guides_for()
30010 return cands; in ctor_deduction_guides_for()
30065 cands = lookup_add (*it, cands); in deduction_guides_for()
30068 cache->value = cands; in deduction_guides_for()
30069 return cands; in deduction_guides_for()
30228 cands = pruned; in do_class_deduction()
30234 cands = lookup_add (guide, cands); in do_class_deduction()
[all …]
H A Dcall.c3543 splice_viable (struct z_candidate *cands, in splice_viable() argument
3561 cand = &cands; in splice_viable()
3577 *last_viable = cands; in splice_viable()
3578 cands = viable; in splice_viable()
3598 return viable ? viable : cands; in splice_viable()
3602 any_strictly_viable (struct z_candidate *cands) in any_strictly_viable() argument
3604 for (; cands; cands = cands->next) in any_strictly_viable()
3605 if (cands->viable == 1) in any_strictly_viable()
H A Dcall.cc3683 splice_viable (struct z_candidate *cands, in splice_viable() argument
3701 cand = &cands; in splice_viable()
3717 *last_viable = cands; in splice_viable()
3718 cands = viable; in splice_viable()
3738 return viable ? viable : cands; in splice_viable()
3742 any_strictly_viable (struct z_candidate *cands) in any_strictly_viable() argument
3744 for (; cands; cands = cands->next) in any_strictly_viable()
3745 if (cands->viable == 1) in any_strictly_viable()