| /toolchain/binutils/binutils-2.27/gas/config/ |
| tc-m68851.h | 34 110 SCC Stack Change Control
73 #define SCC (VAL+1) /* 54 */
74 #define AC (SCC+1) /* 55 */
157 /* TC, CRP, DRP, SRP, CAL, VAL, SCC, AC */
|
| m68k-parse.h | 148 SCC,
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| GlobalsModRef.cpp | 370 // We do a bottom-up SCC traversal of the call graph. In other words, we
374 std::vector<CallGraphNode *> &SCC = *I;
375 assert(!SCC.empty() && "SCC with no functions?");
377 if (!SCC[0]->getFunction()) {
380 for (unsigned i = 0, e = SCC.size(); i != e; ++i)
381 FunctionInfo.erase(SCC[i]->getFunction());
385 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()];
392 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) {
393 Function *F = SCC[i]->getFunction()
[all...] |
| /external/llvm/lib/Analysis/ |
| GlobalsModRef.cpp | 449 // We do a bottom-up SCC traversal of the call graph. In other words, we
453 const std::vector<CallGraphNode *> &SCC = *I;
454 assert(!SCC.empty() && "SCC with no functions?");
456 for (auto *CGN : SCC)
468 // We do a bottom-up SCC traversal of the call graph. In other words, we
471 const std::vector<CallGraphNode *> &SCC = *I;
472 assert(!SCC.empty() && "SCC with no functions?");
474 if (!SCC[0]->getFunction() || !SCC[0]->getFunction()->isDefinitionExact())
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
64 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
66 /// that functions already visited in a bottom-up order of the SCC DAG are no
68 /// a bottom-up order of the SCC DAG are not required to have already been
72 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
73 /// in the SCC DAG, the more independence there is in optimizing within it.
108 class SCC;
196 friend class LazyCallGraph::SCC;
203 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
65 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
67 /// that functions already visited in a bottom-up order of the SCC DAG are no
69 /// a bottom-up order of the SCC DAG are not required to have already been
73 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
74 /// in the SCC DAG, the more independence there is in optimizing within it.
110 class SCC;
366 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
398 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
65 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
67 /// that functions already visited in a bottom-up order of the SCC DAG are no
69 /// a bottom-up order of the SCC DAG are not required to have already been
73 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
74 /// in the SCC DAG, the more independence there is in optimizing within it.
110 class SCC;
366 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
398 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
65 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
67 /// that functions already visited in a bottom-up order of the SCC DAG are no
69 /// a bottom-up order of the SCC DAG are not required to have already been
73 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
74 /// in the SCC DAG, the more independence there is in optimizing within it.
110 class SCC;
366 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
398 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
65 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
67 /// that functions already visited in a bottom-up order of the SCC DAG are no
69 /// a bottom-up order of the SCC DAG are not required to have already been
73 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
74 /// in the SCC DAG, the more independence there is in optimizing within it.
110 class SCC;
366 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
398 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
65 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
67 /// that functions already visited in a bottom-up order of the SCC DAG are no
69 /// a bottom-up order of the SCC DAG are not required to have already been
73 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
74 /// in the SCC DAG, the more independence there is in optimizing within it.
110 class SCC;
366 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
398 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
65 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
67 /// that functions already visited in a bottom-up order of the SCC DAG are no
69 /// a bottom-up order of the SCC DAG are not required to have already been
73 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
74 /// in the SCC DAG, the more independence there is in optimizing within it.
110 class SCC;
366 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
398 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| LazyCallGraph.h | 21 /// visited prior to a caller (given any SCC constraints), or vice versa. As
71 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
73 /// that functions already visited in a bottom-up order of the SCC DAG are no
75 /// a bottom-up order of the SCC DAG are not required to have already been
79 /// SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points
80 /// in the SCC DAG, the more independence there is in optimizing within it.
116 class SCC;
389 // of an SCC (or RefSCC), or '0' when not yet reached in a DFS walk.
420 /// An SCC of the call graph
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | [all...] |
