| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | gimple-ssa-split-paths.cc | 162 basic_block pred1 = EDGE_PRED (bb, 0)->src; in is_feasible_trace() local
166 = EDGE_COUNT (pred1->succs) == 1 ? count_stmts_in_block (pred1) : 0; in is_feasible_trace()
176 gimple *stmt1 = last_and_only_stmt (pred1); 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()
223 gimple *stmt1 = last_and_only_stmt (pred1); 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()
270 gimple *cond_stmt = last_stmt (pred1); in is_feasible_trace()
|
| H A D | gimple-predicate-analysis.cc | 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()
805 tree_code c1 = pred1.cond_code, c2; in pred_equal_p()
806 if (pred1.invert != pred2.invert in pred_equal_p()
871 subset_of (const pred_info &pred1, const pred_info &pred2) in subset_of() argument
873 if (pred_equal_p (pred1, pred2)) in subset_of()
876 if ((TREE_CODE (pred1.pred_rhs) != INTEGER_CST) in subset_of()
880 if (!operand_equal_p (pred1.pred_lhs, pred2.pred_lhs, 0)) in subset_of()
883 tree_code code1 = pred1.cond_code; in subset_of()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | gimple-ssa-split-paths.c | 161 basic_block pred1 = EDGE_PRED (bb, 0)->src; in is_feasible_trace() local
165 = EDGE_COUNT (pred1->succs) == 1 ? count_stmts_in_block (pred1) : 0; in is_feasible_trace()
175 gimple *stmt1 = last_and_only_stmt (pred1); 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()
222 gimple *stmt1 = last_and_only_stmt (pred1); in is_feasible_trace()
|
| H A D | tree-ssa-uninit.c | 1510 is_pred_chain_subset_of (pred_chain pred1, pred_chain pred2) in is_pred_chain_subset_of() argument
1514 np1 = pred1.length (); in is_pred_chain_subset_of()
1523 pred_info info1 = pred1[i1]; in is_pred_chain_subset_of()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/config/arm/ |
| H A D | arm-simd-builtin-types.def | 55 ENTRY (Pred1x16_t, V16BI, predicate, 16, pred1, 16)
56 ENTRY (Pred2x8_t, V8BI, predicate, 8, pred1, 15)
57 ENTRY (Pred4x4_t, V4BI, predicate, 4, pred1, 15)
|
| /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
3917 machine_mode mode = GET_MODE (pred1[0]); in aarch64_sve_same_pred_for_ptest_p()
3920 && aarch64_sve_ptrue_flag (pred1[1], SImode) in aarch64_sve_same_pred_for_ptest_p()
3923 bool ptrue1_p = (pred1[0] == CONSTM1_RTX (mode) in aarch64_sve_same_pred_for_ptest_p()
3924 || INTVAL (pred1[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 | 845 pred1
|
| /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
5204 machine_mode mode = GET_MODE (pred1[0]); in aarch64_sve_same_pred_for_ptest_p()
5207 && aarch64_sve_ptrue_flag (pred1[1], SImode) in aarch64_sve_same_pred_for_ptest_p()
5210 bool ptrue1_p = (pred1[0] == CONSTM1_RTX (mode) in aarch64_sve_same_pred_for_ptest_p()
5211 || INTVAL (pred1[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()
|