| /src/external/gpl3/gcc/dist/gcc/config/mmix/ |
| mmix.cc | 2699 const struct cc_conv *const convs; member in struct:cc_type_conv
2761 for (j = 0; cc_convs[i].convs[j].cc != UNKNOWN; j++)
2762 if (cc == cc_convs[i].convs[j].cc)
2765 = (reversed ? cc_convs[i].convs[j].reversed
2766 : cc_convs[i].convs[j].normal);
|
| /src/external/gpl3/gcc/dist/gcc/cp/ |
| search.cc | 2532 /* Attach the child convs to any we had at this level. */
2550 found within this portion of the graph in CONVS. Return nonzero if
2565 tree parent_convs, tree other_convs, tree *convs)
2574 *convs = NULL_TREE;
2634 *convs = split_conversions (my_convs, parent_convs,
2652 tree convs;
2658 lookup_conversions_r (TYPE_BINFO (type), 0, 0, NULL_TREE, NULL_TREE, &convs);
2663 for (; convs; convs = TREE_CHAIN (convs))
2648 tree convs; local
[all...] |
| name-lookup.cc | 1724 tree convs = NULL_TREE; local
1730 convs = lookup_add (*iter, convs);
1736 if (!convs)
1737 convs = tpls;
1739 return convs;
|
| call.cc | 509 conversion **convs; member in struct:z_candidate
2236 size_t num_convs, conversion **convs,
2247 cand->convs = convs;
2257 if (convs && cand->reversed ())
2260 std::swap (convs[0], convs[1]);
2411 conversion **convs,
2443 if (!convs)
2444 convs = alloc_conversions (len)
2627 conversion **convs; local
2723 conversion **convs; local
3397 tree convs; local
3515 conversion **convs = NULL; local
5315 tree fns, convs, first_mem_arg = NULL_TREE; local
9900 conversion **convs = cand->convs; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/mmix/ |
| mmix.cc | 2699 const struct cc_conv *const convs; member in struct:cc_type_conv
2761 for (j = 0; cc_convs[i].convs[j].cc != UNKNOWN; j++)
2762 if (cc == cc_convs[i].convs[j].cc)
2765 = (reversed ? cc_convs[i].convs[j].reversed
2766 : cc_convs[i].convs[j].normal);
|
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| search.cc | 2414 /* Attach the child convs to any we had at this level. */
2432 found within this portion of the graph in CONVS. Return nonzero if
2447 tree parent_convs, tree other_convs, tree *convs)
2456 *convs = NULL_TREE;
2516 *convs = split_conversions (my_convs, parent_convs,
2534 tree convs;
2540 lookup_conversions_r (TYPE_BINFO (type), 0, 0, NULL_TREE, NULL_TREE, &convs);
2545 for (; convs; convs = TREE_CHAIN (convs))
2530 tree convs; local
[all...] |
| name-lookup.cc | 1719 tree convs = NULL_TREE; local
1725 convs = lookup_add (*iter, convs);
1731 if (!convs)
1732 convs = tpls;
1734 return convs;
|
| call.cc | 499 conversion **convs; member in struct:z_candidate
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)
2534 conversion **convs; local
2622 conversion **convs; local
3296 tree convs; local
3414 conversion **convs = NULL; local
5005 tree fns, convs, first_mem_arg = NULL_TREE; local
9211 conversion **convs = cand->convs; local
[all...] |
