| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-modref-tree.cc | 580 int best1 = -1, best2 = -1; local
584 if (best1 < 0
587 (*accesses)[best1],
590 best1 = i;
595 (*accesses)[best1],
598 best1 = i;
602 (*accesses)[best1].forced_merge (best2 < 0 ? a : (*accesses)[best2],
605 gcc_checking_assert ((*accesses)[best1].contains
607 if (!(*accesses)[best1].useful_p ())
612 " merging %i and %i\n", best1, best2)
[all...] |
| ipa-modref-tree.cc | 580 int best1 = -1, best2 = -1; local
584 if (best1 < 0
587 (*accesses)[best1],
590 best1 = i;
595 (*accesses)[best1],
598 best1 = i;
602 (*accesses)[best1].forced_merge (best2 < 0 ? a : (*accesses)[best2],
605 gcc_checking_assert ((*accesses)[best1].contains
607 if (!(*accesses)[best1].useful_p ())
612 " merging %i and %i\n", best1, best2)
[all...] |
| ipa-modref-tree.cc | 580 int best1 = -1, best2 = -1; local
584 if (best1 < 0
587 (*accesses)[best1],
590 best1 = i;
595 (*accesses)[best1],
598 best1 = i;
602 (*accesses)[best1].forced_merge (best2 < 0 ? a : (*accesses)[best2],
605 gcc_checking_assert ((*accesses)[best1].contains
607 if (!(*accesses)[best1].useful_p ())
612 " merging %i and %i\n", best1, best2)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-modref-tree.cc | 585 int best1 = -1, best2 = -1; local
589 if (best1 < 0
592 (*accesses)[best1],
595 best1 = i;
600 (*accesses)[best1],
603 best1 = i;
607 (*accesses)[best1].forced_merge (best2 < 0 ? a : (*accesses)[best2],
610 gcc_checking_assert ((*accesses)[best1].contains
612 if (!(*accesses)[best1].useful_p ())
617 " merging %i and %i\n", best1, best2)
[all...] |
| ipa-modref-tree.cc | 585 int best1 = -1, best2 = -1; local
589 if (best1 < 0
592 (*accesses)[best1],
595 best1 = i;
600 (*accesses)[best1],
603 best1 = i;
607 (*accesses)[best1].forced_merge (best2 < 0 ? a : (*accesses)[best2],
610 gcc_checking_assert ((*accesses)[best1].contains
612 if (!(*accesses)[best1].useful_p ())
617 " merging %i and %i\n", best1, best2)
[all...] |
| ipa-modref-tree.cc | 585 int best1 = -1, best2 = -1; local
589 if (best1 < 0
592 (*accesses)[best1],
595 best1 = i;
600 (*accesses)[best1],
603 best1 = i;
607 (*accesses)[best1].forced_merge (best2 < 0 ? a : (*accesses)[best2],
610 gcc_checking_assert ((*accesses)[best1].contains
612 if (!(*accesses)[best1].useful_p ())
617 " merging %i and %i\n", best1, best2)
[all...] |
