dist/gcc/tree-ssa-sccvn.c

186 /* Compare two phi entries for equality, ignoring VN_TOP arguments.  */
320 tree VN_TOP;
393   newinfo->valnum = VN_TOP;
399      different than VN_TOP here.  */
488       gcc_assert (x != VN_TOP);
508       gcc_assert (vuse != VN_TOP);
4222       /* Don't hash backedge values they need to be handled as VN_TOP
4228       if (phi1op == VN_TOP)
4271 /* Compare two phi entries for equality, ignoring VN_TOP arguments.  */
4337 	    /* ???  Handle VN_TOP specially.  */
4363       if (phi1op == VN_TOP || phi2op == VN_TOP)
4407 	   allow VN_TOP.  */
4452 	   allow VN_TOP.  */
4567      and invariants.  So assert that here.  We don't allow VN_TOP
4570      ???  Still VN_TOP can happen for unreachable code, so force
4572      get VN_TOP on valueization.  */
4573   if (to == VN_TOP)
4576          for the first time we rightfully get VN_TOP and we need to
4580       if (currval == VN_TOP)
4584 		 "receiving VN_TOP\n");
4610       if (currval != VN_TOP
4628       else if (currval != VN_TOP
4678 	  && currval != VN_TOP
5169   tree result, sameval = VN_TOP, seen_undef = NULL_TREE;
5208 	if (def == VN_TOP)
5215 	else if (sameval == VN_TOP)
5265   /* If none of the edges was executable keep the value-number at VN_TOP,
5269   /* If we saw only undefined values and VN_TOP use one of the
5271   else if (sameval == VN_TOP)
5633   /* If either one is VN_TOP consider them equal.  */
5634   if (e1 == VN_TOP || e2 == VN_TOP)
5911 	  if (val != VN_TOP
6696 	  || info->valnum == VN_TOP)
6848   else if (valnum != VN_TOP)
6860   if (valnum == VN_TOP
6897 	  if (tem != VN_TOP && tem != name)
7008 	    res_info->valnum = VN_TOP;
7099 	      op_info->valnum = VN_TOP;
7476   VN_TOP = create_tmp_var_raw (void_type_node, "vn_top");