| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachinePipeliner.cpp | 1167 /// Iterate over each circuit. Compute the delay(c) and distance(c)
1168 /// for each circuit. The II needs to satisfy the inequality
1169 /// delay(c) - II*distance(c) <= 0. For each circuit, choose the smallest
1274 /// Identify an elementary circuit in the dependence graph starting at the
1276 bool SwingSchedulerDAG::Circuits::circuit(int V, int S, NodeSetType &NodeSets, function in class:SwingSchedulerDAG::Circuits
1295 if (circuit(W, S, NodeSets,
1315 /// Unblock a node in the circuit finding algorithm.
1330 /// Johnson's circuit algorithm.
1341 Cir.circuit(i, i, NodeSets);
2766 // is not part of circuit, then the NodeOrder is no
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gcov.cc | 820 /* Find circuit going to block V, PATH is provisional seen cycle.
826 circuit (block_info *v, arc_vector_t &path, block_info *start, function
854 loop_found |= circuit (w, path, start, blocked, block_lists, linfo,
888 Each iteration of the circuit detection is completely independent
900 circuit (*it, path, *it, blocked, block_lists, linfo, count);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gcov.cc | 776 /* Find circuit going to block V, PATH is provisional seen cycle.
782 circuit (block_info *v, arc_vector_t &path, block_info *start, function
810 loop_found |= circuit (w, path, start, blocked, block_lists, linfo,
844 Each iteration of the circuit detection is completely independent
856 circuit (*it, path, *it, blocked, block_lists, linfo, count);
|
