Home | History | Annotate | Download | only in gcc

Lines Matching defs:vertices

3548 /* Fill the vertices and leafs vector with all nodes in the SLP graph.  */
3552 			 vec<slpg_vertex> &vertices, vec<int> &leafs)
3560   node->vertex = vertices.length ();
3561   vertices.safe_push (slpg_vertex (node));
3569 	vect_slp_build_vertices (visited, child, vertices, leafs);
3582 /* Fill the vertices and leafs vector with all nodes in the SLP graph.  */
3585 vect_slp_build_vertices (vec_info *info, vec<slpg_vertex> &vertices,
3592     vect_slp_build_vertices (visited, SLP_INSTANCE_TREE (instance), vertices,
3648   auto_vec<slpg_vertex> vertices;
3650   vect_slp_build_vertices (vinfo, vertices, leafs);
3652   struct graph *slpg = new_graph (vertices.length ());
3653   for (slpg_vertex &v : vertices)
3669       slp_tree node = vertices[idx].node;
3681       if (!slpg->vertices[idx].succ)
3683 	  vertices[idx].perm_in = 0;
3684 	  vertices[idx].perm_out = 0;
3735       vertices[idx].perm_in = perms.length () - 1;
3736       vertices[idx].perm_out = perms.length () - 1;
3746 	vertices[SLP_INSTANCE_TREE (instance)->vertex].perm_in = 0;
3747 	vertices[SLP_INSTANCE_TREE (instance)->vertex].perm_out = 0;
3759 	    vertices[node_i].perm_in = 0;
3760 	    vertices[node_i].perm_out = 0;
3777       for (i = vertices.length (); i > 0 ; --i)
3780 	  slp_tree node = vertices[idx].node;
3803 		  vertices[idx].perm_in = 0;
3804 		  vertices[idx].perm_out = 0;
3820 		    vertices[idx].perm_in = 0;
3821 		    vertices[idx].perm_out = 0;
3826 	  if (!slpg->vertices[idx].succ)
3832 	      int perm_in = vertices[idx].perm_in;
3833 	      for (graph_edge *succ = slpg->vertices[idx].succ;
3837 		  int succ_perm = vertices[succ_idx].perm_out;
3848 		      slp_tree succ_node = vertices[succ_idx].node;
3867 		  for (graph_edge *succ = slpg->vertices[idx].succ;
3870 		      slp_tree succ_node = vertices[succ->dest].node;
3871 		      if (vertices[succ->dest].perm_out == -1
3875 			  vertices[succ->dest].perm_out = perm_in;
3877 			  if (vertices[succ->dest].perm_in == -1)
3878 			    vertices[succ->dest].perm_in = perm_in;
3885 				      vertices[idx].perm_in))
3888 		  gcc_checking_assert (vertices[idx].perm_in == -1
3890 		  vertices[idx].perm_in = perm_in;
3901 		  if (vertices[idx].perm_out != 0
3903 		    vertices[idx].perm_out = perm_in;
3913 	  int perm = vertices[idx].perm_out;
3920 	  bool all_preds_permuted = slpg->vertices[idx].pred != NULL;
3922 	    for (graph_edge *pred = slpg->vertices[idx].pred;
3925 		int pred_perm = vertices[pred->src].perm_in;
3935 	      vertices[idx].perm_out = 0;
3952   for (i = 0; i < vertices.length (); ++i)
3954       int perm_in = vertices[i].perm_in;
3955       slp_tree node = vertices[i].node;
3978 		gcc_assert (slpg->vertices[child->vertex].pred->pred_next);
4006 	  int perm_out = vertices[i].perm_out;
4015       else if (vertices[i].get_perm_materialized () != 0)
4124 		   && vertices[old->vertex].get_perm_materialized () != 0)
4131 	      int perm = vertices[old->vertex].get_perm_materialized ();
4149       node = vertices[leafs[i]].node;