| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | gimple-ssa-split-paths.cc | 163 basic_block pred2 = EDGE_PRED (bb, 1)->src; in is_feasible_trace() local
168 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0; in is_feasible_trace()
177 gimple *stmt2 = last_and_only_stmt (pred2); in is_feasible_trace()
215 std::swap (pred1, pred2); in is_feasible_trace()
221 && dominated_by_p (CDI_DOMINATORS, pred1, pred2)) in is_feasible_trace()
259 if (single_pred_p (pred1) && single_pred (pred1) == pred2 in is_feasible_trace()
261 std::swap (pred1, pred2); in is_feasible_trace()
267 if (single_pred_p (pred2) && single_pred (pred2) == pred1 in is_feasible_trace()
|
| H A D | gimple-predicate-analysis.cc | 299 const pred_info &pred2 = chain[j]; in find_matching_predicate_in_rest_chains() local
304 if (operand_equal_p (pred2.pred_lhs, pred.pred_lhs, 0) in find_matching_predicate_in_rest_chains()
305 && operand_equal_p (pred2.pred_rhs, pred.pred_rhs, 0) in find_matching_predicate_in_rest_chains()
306 && pred2.invert == pred.invert) in find_matching_predicate_in_rest_chains()
799 pred_equal_p (const pred_info &pred1, const pred_info &pred2) in pred_equal_p() argument
801 if (!operand_equal_p (pred1.pred_lhs, pred2.pred_lhs, 0) in pred_equal_p()
802 || !operand_equal_p (pred1.pred_rhs, pred2.pred_rhs, 0)) in pred_equal_p()
806 if (pred1.invert != pred2.invert in pred_equal_p()
807 && TREE_CODE_CLASS (pred2.cond_code) == tcc_comparison) in pred_equal_p()
808 c2 = invert_tree_comparison (pred2.cond_code, false); in pred_equal_p()
[all …]
|
| H A D | predict.cc | 1329 struct edge_prediction *pred2; in combine_predictions_for_bb() local
1332 for (pred2 = (struct edge_prediction *) *preds; in combine_predictions_for_bb()
1333 pred2; pred2 = pred2->ep_next) in combine_predictions_for_bb()
1334 if (pred2 != pred && pred2->ep_predictor == pred->ep_predictor) in combine_predictions_for_bb()
1336 int probability2 = pred2->ep_probability; in combine_predictions_for_bb()
1338 if (pred2->ep_edge != first) in combine_predictions_for_bb()
1350 if (!pred2) in combine_predictions_for_bb()
|
| H A D | combine.cc | 1728 rtx_insn *pred2 ATTRIBUTE_UNUSED, rtx_insn *succ, rtx_insn *succ2, in can_combine_p()
2033 || (pred2 != NULL_RTX in can_combine_p()
2034 && reg_overlap_mentioned_p (XEXP (link, 0), PATTERN (pred2))) in can_combine_p()
|
| H A D | ChangeLog-2014 | 27081 "pred2", "succ", "succ2" and for local "p".
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | gimple-ssa-split-paths.c | 162 basic_block pred2 = EDGE_PRED (bb, 1)->src; in is_feasible_trace() local
167 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0; in is_feasible_trace()
176 gimple *stmt2 = last_and_only_stmt (pred2); in is_feasible_trace()
214 std::swap (pred1, pred2); in is_feasible_trace()
220 && dominated_by_p (CDI_DOMINATORS, pred1, pred2)) in is_feasible_trace()
|
| H A D | tree-ssa-uninit.c | 1089 pred_info pred2 = one_chain[j]; in find_matching_predicate_in_rest_chains() local
1096 if (operand_equal_p (pred2.pred_lhs, pred.pred_lhs, 0) in find_matching_predicate_in_rest_chains()
1097 && operand_equal_p (pred2.pred_rhs, pred.pred_rhs, 0) in find_matching_predicate_in_rest_chains()
1098 && pred2.invert == pred.invert) in find_matching_predicate_in_rest_chains()
1510 is_pred_chain_subset_of (pred_chain pred1, pred_chain pred2) in is_pred_chain_subset_of() argument
1515 np2 = pred2.length (); in is_pred_chain_subset_of()
1520 pred_info info2 = pred2[i2]; in is_pred_chain_subset_of()
|
| H A D | predict.c | 1291 struct edge_prediction *pred2; in combine_predictions_for_bb() local
1294 for (pred2 = (struct edge_prediction *) *preds; in combine_predictions_for_bb()
1295 pred2; pred2 = pred2->ep_next) in combine_predictions_for_bb()
1296 if (pred2 != pred && pred2->ep_predictor == pred->ep_predictor) in combine_predictions_for_bb()
1298 int probability2 = pred2->ep_probability; in combine_predictions_for_bb()
1300 if (pred2->ep_edge != first) in combine_predictions_for_bb()
1312 if (!pred2) in combine_predictions_for_bb()
|
| H A D | combine.c | 1827 rtx_insn *pred2 ATTRIBUTE_UNUSED, rtx_insn *succ, rtx_insn *succ2, in can_combine_p()
2132 || (pred2 != NULL_RTX in can_combine_p()
2133 && reg_overlap_mentioned_p (XEXP (link, 0), PATTERN (pred2))) in can_combine_p()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| H A D | searching.d | 627 bool pred2(ElementType!Range a) { return binaryFun!pred(a, needle); }
628 return count!pred2(haystack);
847 bool pred2(ElementType!R a) { return binaryFun!pred(a, needle); }
848 return countUntil!pred2(haystack);
|
| /netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/algorithm/ |
| H A D | searching.d | 643 bool pred2(ElementType!Range a) { return binaryFun!pred(a, needle); }
644 return count!pred2(haystack);
870 bool pred2(ElementType!R a) { return binaryFun!pred(a, needle); }
871 return countUntil!pred2(haystack);
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/config/aarch64/ |
| H A D | aarch64.c | 3915 aarch64_sve_same_pred_for_ptest_p (rtx *pred1, rtx *pred2) in aarch64_sve_same_pred_for_ptest_p() argument
3919 && mode == GET_MODE (pred2[0]) in aarch64_sve_same_pred_for_ptest_p()
3921 && aarch64_sve_ptrue_flag (pred2[1], SImode)); in aarch64_sve_same_pred_for_ptest_p()
3925 bool ptrue2_p = (pred2[0] == CONSTM1_RTX (mode) in aarch64_sve_same_pred_for_ptest_p()
3926 || INTVAL (pred2[1]) == SVE_KNOWN_PTRUE); in aarch64_sve_same_pred_for_ptest_p()
3927 return (ptrue1_p && ptrue2_p) || rtx_equal_p (pred1[0], pred2[0]); in aarch64_sve_same_pred_for_ptest_p()
|
| /netbsd-src/share/man/tools/ |
| H A D | newsp.errs | 846 pred2
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| H A D | aarch64.cc | 5202 aarch64_sve_same_pred_for_ptest_p (rtx *pred1, rtx *pred2) in aarch64_sve_same_pred_for_ptest_p() argument
5206 && mode == GET_MODE (pred2[0]) in aarch64_sve_same_pred_for_ptest_p()
5208 && aarch64_sve_ptrue_flag (pred2[1], SImode)); in aarch64_sve_same_pred_for_ptest_p()
5212 bool ptrue2_p = (pred2[0] == CONSTM1_RTX (mode) in aarch64_sve_same_pred_for_ptest_p()
5213 || INTVAL (pred2[1]) == SVE_KNOWN_PTRUE); in aarch64_sve_same_pred_for_ptest_p()
5214 return (ptrue1_p && ptrue2_p) || rtx_equal_p (pred1[0], pred2[0]); in aarch64_sve_same_pred_for_ptest_p()
|