Home | History | Annotate | Download | only in gcc

Lines Matching defs:cycle

36       cancel_negative_cycle: While G contains a negative cost cycle C, reverse
37       the flow on the found cycle by the minimum residual capacity in that
38       cycle.
87   /* Residual flow for this edge - used during negative cycle canceling.  */
768 /* Finds a negative cycle in the residual network using
769    the Bellman-Ford algorithm. The flow on the found cycle is reversed by the
770    minimum residual capacity of that cycle. ENTRY and EXIT vertices are not
778    CYCLE - Vector to hold the minimum cost cycle
781    true if a negative cycle was found, false otherwise.  */
785 		       int *pi, gcov_type *d, int *cycle)
808       cycle[i] = -1;
856   /* Augment the cycle with the cycle's minimum residual capacity.  */
858   cycle[0] = pfedge->dest;
864       cycle[i] = j;
867 	  if (cycle[k] == j)
869 	      /* cycle[k] -> ... -> cycle[i].  */
880   gcc_assert (cycle[cycle_start] == cycle[cycle_end]);
882     fprintf (dump_file, "\nNegative cycle length is %d:\n",
889       pfedge = find_fixup_edge (fixup_graph, cycle[k + 1], cycle[k]);
893 	fprintf (dump_file, "%d ", cycle[k]);
898       fprintf (dump_file, "%d", cycle[k]);
903 	       "Augment cycle with %" PRId64 "\n",
909       pfedge = find_fixup_edge (fixup_graph, cycle[k + 1], cycle[k]);
910       r_pfedge = find_fixup_edge (fixup_graph, cycle[k], cycle[k + 1]);
1287 /* Implements the negative cycle canceling algorithm to compute a minimum cost
1293   While G contains a negative cost cycle C, reverse the flow on the found cycle
1294   by the minimum residual capacity in that cycle.
1306   /* Used to hold the minimum cost cycle.  */
1307   int *cycle;
1326   cycle = (int *) xcalloc (fnum_vertices, sizeof (int));
1332   while (cancel_negative_cycle (fixup_graph, pred, d, cycle))
1347   free (cycle);