Searched refs:pred2 (Results 1 - 12 of 12) sorted by relevance

/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dgimple-ssa-split-paths.cc163 basic_block pred2 = EDGE_PRED (bb, 1)->src; local
168 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0;
177 gimple *stmt2 = last_and_only_stmt (pred2);
215 std::swap (pred1, pred2);
221 && dominated_by_p (CDI_DOMINATORS, pred1, pred2))
259 if (single_pred_p (pred1) && single_pred (pred1) == pred2
261 std::swap (pred1, pred2);
267 if (single_pred_p (pred2) && single_pred (pred2)
[all...]
H A Dgimple-predicate-analysis.cc299 const pred_info &pred2 = chain[j]; local
304 if (operand_equal_p (pred2.pred_lhs, pred.pred_lhs, 0)
305 && operand_equal_p (pred2.pred_rhs, pred.pred_rhs, 0)
306 && pred2.invert == pred.invert)
799 pred_equal_p (const pred_info &pred1, const pred_info &pred2) argument
801 if (!operand_equal_p (pred1.pred_lhs, pred2.pred_lhs, 0)
802 || !operand_equal_p (pred1.pred_rhs, pred2.pred_rhs, 0))
806 if (pred1.invert != pred2.invert
807 && TREE_CODE_CLASS (pred2.cond_code) == tcc_comparison)
808 c2 = invert_tree_comparison (pred2
871 subset_of(const pred_info &pred1, const pred_info &pred2) argument
[all...]
H A Dpredict.cc1329 struct edge_prediction *pred2; local
1332 for (pred2 = (struct edge_prediction *) *preds;
1333 pred2; pred2 = pred2->ep_next)
1334 if (pred2 != pred && pred2->ep_predictor == pred->ep_predictor)
1336 int probability2 = pred2->ep_probability;
1338 if (pred2->ep_edge != first)
1350 if (!pred2)
[all...]
H A Dcombine.cc1739 rtx_insn *pred2 ATTRIBUTE_UNUSED, rtx_insn *succ, rtx_insn *succ2,
2044 || (pred2 != NULL_RTX
2045 && reg_overlap_mentioned_p (XEXP (link, 0), PATTERN (pred2)))
/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dgimple-ssa-split-paths.c162 basic_block pred2 = EDGE_PRED (bb, 1)->src; local
167 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0;
176 gimple *stmt2 = last_and_only_stmt (pred2);
214 std::swap (pred1, pred2);
220 && dominated_by_p (CDI_DOMINATORS, pred1, pred2))
H A Dtree-ssa-uninit.c1089 pred_info pred2 = one_chain[j]; local
1096 if (operand_equal_p (pred2.pred_lhs, pred.pred_lhs, 0)
1097 && operand_equal_p (pred2.pred_rhs, pred.pred_rhs, 0)
1098 && pred2.invert == pred.invert)
1510 is_pred_chain_subset_of (pred_chain pred1, pred_chain pred2) argument
1515 np2 = pred2.length ();
1520 pred_info info2 = pred2[i2];
H A Dpredict.c1291 struct edge_prediction *pred2; local
1294 for (pred2 = (struct edge_prediction *) *preds;
1295 pred2; pred2 = pred2->ep_next)
1296 if (pred2 != pred && pred2->ep_predictor == pred->ep_predictor)
1298 int probability2 = pred2->ep_probability;
1300 if (pred2->ep_edge != first)
1312 if (!pred2)
[all...]
H A Dcombine.c1838 rtx_insn *pred2 ATTRIBUTE_UNUSED, rtx_insn *succ, rtx_insn *succ2,
2143 || (pred2 != NULL_RTX
2144 && reg_overlap_mentioned_p (XEXP (link, 0), PATTERN (pred2)))
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
H A Dsearching.d627 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-current/external/gpl3/gcc/dist/libphobos/src/std/algorithm/
H A Dsearching.d643 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-current/external/gpl3/gcc.old/dist/gcc/config/aarch64/
H A Daarch64.c3915 aarch64_sve_same_pred_for_ptest_p (rtx *pred1, rtx *pred2) argument
3919 && mode == GET_MODE (pred2[0])
3921 && aarch64_sve_ptrue_flag (pred2[1], SImode));
3925 bool ptrue2_p = (pred2[0] == CONSTM1_RTX (mode)
3926 || INTVAL (pred2[1]) == SVE_KNOWN_PTRUE);
3927 return (ptrue1_p && ptrue2_p) || rtx_equal_p (pred1[0], pred2[0]);
/netbsd-current/external/gpl3/gcc/dist/gcc/config/aarch64/
H A Daarch64.cc5202 aarch64_sve_same_pred_for_ptest_p (rtx *pred1, rtx *pred2) argument
5206 && mode == GET_MODE (pred2[0])
5208 && aarch64_sve_ptrue_flag (pred2[1], SImode));
5212 bool ptrue2_p = (pred2[0] == CONSTM1_RTX (mode)
5213 || INTVAL (pred2[1]) == SVE_KNOWN_PTRUE);
5214 return (ptrue1_p && ptrue2_p) || rtx_equal_p (pred1[0], pred2[0]);

Completed in 275 milliseconds