HomeSort by relevance Sort by last modified time
    Searched full:breakcycles (Results 1 - 6 of 6) sorted by null

  /system/update_engine/payload_generator/
cycle_breaker_unittest.cc 79 breaker.BreakCycles(graph, &broken_edges);
166 breaker.BreakCycles(graph, &broken_edges);
217 breaker.BreakCycles(graph, &broken_edges);
248 breaker.BreakCycles(graph, &broken_edges);
273 breaker.BreakCycles(graph, &broken_edges);
cycle_breaker.h 46 void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges);
cycle_breaker.cc 39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) {
inplace_generator.cc 608 cycle_breaker.BreakCycles(*graph, &cut_edges);
inplace_generator_unittest.cc 241 cycle_breaker.BreakCycles(graph, &cut_edges);
  /external/r8/src/main/java/com/android/tools/r8/ir/conversion/
CallGraph.java 159 graph.breakCycles();
160 assert graph.breakCycles() == 0; // This time the cycles should be gone.
236 * leaves. See {@link #breakCycles} on how cycles are broken. This ensures that at least one
286 private int breakCycles() {

Completed in 135 milliseconds