dist/gcc/tree-ssa-uninit.c

1712 	  pred_chain *b_chain;
1718 	  b_chain = &(*preds)[j];
1719 	  if (b_chain->length () != 2)
1722 	  x2 = (*b_chain)[0];
1723 	  y2 = (*b_chain)[1];
1729 	      b_chain->release ();
1730 	      b_chain->safe_push (x);
1738 	      b_chain->release ();
1739 	      b_chain->safe_push (y);
1792 	  pred_chain *b_chain;
1799 	  b_chain = &(*preds)[j];
1800 	  if (b_chain->length () < 2)
1803 	  for (k = 0; k < b_chain->length (); k++)
1805 	      x2 = (*b_chain)[k];
1808 		  b_chain->unordered_remove (k);
1855 	  pred_chain *b_chain;
1861 	  b_chain = &(*preds)[j];
1862 	  if (b_chain->length () != 2)
1865 	  x2 = (*b_chain)[0];
1866 	  y2 = (*b_chain)[1];