contrib/gcc/tree-ssa-reassoc.c

54     expressions into a vector of operand_entry_t
174 } *operand_entry_t;
190 static operand_entry_t
200   return ((operand_entry_t) *slot);
209   operand_entry_t new_pair = pool_alloc (operand_entry_pool);
223   const operand_entry_t vr = (operand_entry_t) p;
232   const operand_entry_t vr1 = (operand_entry_t) p1;
233   const operand_entry_t vr2 = (operand_entry_t) p2;
242   operand_entry_t vr;
316 DEF_VEC_P(operand_entry_t);
317 DEF_VEC_ALLOC_P(operand_entry_t, heap);
343   const operand_entry_t oea = *(const operand_entry_t *)pa;
344   const operand_entry_t oeb = *(const operand_entry_t *)pb;
365 add_to_ops_vec (VEC(operand_entry_t, heap) **ops, tree op)
367   operand_entry_t oe = pool_alloc (operand_entry_pool);
371   VEC_safe_push (operand_entry_t, heap, *ops, oe);
413 			  VEC (operand_entry_t, heap) **ops,
416 			  operand_entry_t curr,
417 			  operand_entry_t last)
443 	  VEC_ordered_remove (operand_entry_t, *ops, i);
460 	  if (VEC_length (operand_entry_t, *ops) == 2)
462 	      VEC_free (operand_entry_t, heap, *ops);
470 	      VEC_ordered_remove (operand_entry_t, *ops, i-1);
471 	      VEC_ordered_remove (operand_entry_t, *ops, i-1);
491 			   VEC (operand_entry_t, heap) **ops,
493 			   operand_entry_t curr)
497   operand_entry_t oe;
511        VEC_iterate (operand_entry_t, *ops, i, oe)
527 	  VEC_ordered_remove (operand_entry_t, *ops, i);
530 	  VEC_ordered_remove (operand_entry_t, *ops, currindex);
548 		     VEC (operand_entry_t, heap) **ops,
550 		     operand_entry_t curr)
554   operand_entry_t oe;
569        VEC_iterate (operand_entry_t, *ops, i, oe)
597 	    += VEC_length (operand_entry_t, *ops) - 1;
598 	  VEC_free (operand_entry_t, heap, *ops);
600 	  VEC_safe_push (operand_entry_t, heap, *ops, oe);
617 			   VEC(operand_entry_t, heap) **ops)
619   operand_entry_t oelast = VEC_last (operand_entry_t, *ops);
628 	      if (VEC_length (operand_entry_t, *ops) != 1)
634 		    += VEC_length (operand_entry_t, *ops) - 1;
636 		  VEC_free (operand_entry_t, heap, *ops);
638 		  VEC_safe_push (operand_entry_t, heap, *ops, oelast);
644 	      if (VEC_length (operand_entry_t, *ops) != 1)
648 		  VEC_pop (operand_entry_t, *ops);
656 	      if (VEC_length (operand_entry_t, *ops) != 1)
662 		    += VEC_length (operand_entry_t, *ops) - 1;
664 		  VEC_free (operand_entry_t, heap, *ops);
666 		  VEC_safe_push (operand_entry_t, heap, *ops, oelast);
672 	      if (VEC_length (operand_entry_t, *ops) != 1)
676 		  VEC_pop (operand_entry_t, *ops);
684 	      if (VEC_length (operand_entry_t, *ops) != 1)
690 		    += VEC_length (operand_entry_t, *ops) - 1;
691 		  VEC_free (operand_entry_t, heap, *ops);
693 		  VEC_safe_push (operand_entry_t, heap, *ops, oelast);
699 	      if (VEC_length (operand_entry_t, *ops) != 1)
703 		  VEC_pop (operand_entry_t, *ops);
714 	      if (VEC_length (operand_entry_t, *ops) != 1)
718 		  VEC_pop (operand_entry_t, *ops);
736 		   VEC (operand_entry_t, heap) **ops)
738   unsigned int length = VEC_length (operand_entry_t, *ops);
740   operand_entry_t oe;
741   operand_entry_t oelast = NULL;
747   oelast = VEC_last (operand_entry_t, *ops);
753       operand_entry_t oelm1 = VEC_index (operand_entry_t, *ops, length - 2);
768 	      VEC_pop (operand_entry_t, *ops);
769 	      VEC_pop (operand_entry_t, *ops);
783   for (i = 0; VEC_iterate (operand_entry_t, *ops, i, oe);)
802   length  = VEC_length (operand_entry_t, *ops);
803   oelast = VEC_last (operand_entry_t, *ops);
840 		   VEC(operand_entry_t, heap) * ops)
843   operand_entry_t oe;
859   if (opindex + 3 == VEC_length (operand_entry_t, ops))
861       operand_entry_t oe1, oe2, oe3;
863       oe1 = VEC_index (operand_entry_t, ops, opindex);
864       oe2 = VEC_index (operand_entry_t, ops, opindex + 1);
865       oe3 = VEC_index (operand_entry_t, ops, opindex + 2);
886   if (opindex + 2 == VEC_length (operand_entry_t, ops))
888       operand_entry_t oe1, oe2;
890       oe1 = VEC_index (operand_entry_t, ops, opindex);
891       oe2 = VEC_index (operand_entry_t, ops, opindex + 1);
918   gcc_assert (opindex + 2 < VEC_length (operand_entry_t, ops));
921   oe = VEC_index (operand_entry_t, ops, opindex);
1116 linearize_expr_tree (VEC(operand_entry_t, heap) **ops, tree stmt)
1332 	      VEC(operand_entry_t, heap) *ops = NULL;
1341 	      qsort (VEC_address (operand_entry_t, ops),
1342 		     VEC_length (operand_entry_t, ops),
1343 		     sizeof (operand_entry_t),
1347 	      if (VEC_length (operand_entry_t, ops) == 1)
1354 		  TREE_OPERAND (stmt, 1) = VEC_last (operand_entry_t, ops)->op;
1369 	      VEC_free (operand_entry_t, heap, ops);
1379 void dump_ops_vector (FILE *file, VEC (operand_entry_t, heap) *ops);
1380 void debug_ops_vector (VEC (operand_entry_t, heap) *ops);
1385 dump_ops_vector (FILE *file, VEC (operand_entry_t, heap) *ops)
1387   operand_entry_t oe;
1390   for (i = 0; VEC_iterate (operand_entry_t, ops, i, oe); i++)
1400 debug_ops_vector (VEC (operand_entry_t, heap) *ops)