Lines Matching defs:VN_TOP
189 /* Compare two phi entries for equality, ignoring VN_TOP arguments. */
387 tree VN_TOP;
458 newinfo->valnum = VN_TOP;
464 different than VN_TOP here. */
553 gcc_assert (x != VN_TOP);
573 gcc_assert (vuse != VN_TOP);
4442 /* Don't hash backedge values they need to be handled as VN_TOP
4448 if (phi1op == VN_TOP)
4491 /* Compare two phi entries for equality, ignoring VN_TOP arguments. */
4558 to be careful when matching VN_TOP. Be conservative and
4559 only match VN_TOP == VN_TOP for now, we could allow
4560 VN_TOP on the not prevailing PHI though. See for example
4621 def = VN_TOP;
4637 allow VN_TOP. */
4670 def = VN_TOP;
4687 allow VN_TOP. */
4805 and invariants. So assert that here. We don't allow VN_TOP
4808 ??? Still VN_TOP
4810 get VN_TOP on valueization. */
4811 if (to == VN_TOP)
4814 for the first time we rightfully get VN_TOP and we need to
4818 if (currval == VN_TOP)
4822 "receiving VN_TOP\n");
4848 if (currval != VN_TOP
4866 else if (currval != VN_TOP
4916 && currval != VN_TOP
5589 tree result, sameval = VN_TOP, seen_undef = NULL_TREE;
5628 if (def == VN_TOP)
5635 else if (sameval == VN_TOP)
5685 /* If none of the edges was executable keep the value-number at VN_TOP,
5689 /* If we saw only undefined values and VN_TOP use one of the
5691 else if (sameval == VN_TOP)
6065 If match_vn_top_optimistically is true then VN_TOP is equal to anything,
6066 otherwise VN_TOP only matches VN_TOP. */
6075 /* If either one is VN_TOP consider them equal. */
6077 && (e1 == VN_TOP || e2 == VN_TOP))
6388 if (val != VN_TOP
7180 || info->valnum == VN_TOP)
7331 else if (valnum != VN_TOP)
7343 if (valnum == VN_TOP
7382 if (tem != VN_TOP && tem != name)
7493 res_info->valnum = VN_TOP;
7584 op_info->valnum = VN_TOP;
7957 VN_TOP = create_tmp_var_raw (void_type_node, "vn_top");