HomeSort by relevance Sort by last modified time
    Searched refs:getEntryNode (Results 1 - 25 of 376) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/include/llvm/Analysis/
PostDominators.h 92 static NodeType *getEntryNode(PostDominatorTree *DT) {
97 if (getEntryNode(N))
98 return df_begin(getEntryNode(N));
100 return df_end(getEntryNode(N));
104 return df_end(getEntryNode(N));
RegionIterator.h 256 static NodeType *getEntryNode(NodeType* N) { return N; } \
267 static NodeType *getEntryNode(NodeType* N) { return N; } \
280 static NodeType *getEntryNode(RegionT* R) { \
284 return nodes_iterator::begin(getEntryNode(R)); \
287 return nodes_iterator::end(getEntryNode(R)); \
294 static NodeType *getEntryNode(RegionT* R) { \
298 return nodes_iterator::begin(getEntryNode(R)); \
301 return nodes_iterator::end(getEntryNode(R)); \
316 static NodeType *getEntryNode(RegionInfo *RI) {
317 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
PostDominators.h 88 static NodeRef getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 260 static NodeRef getEntryNode(NodeRef N) { return N; } \
272 static NodeRef getEntryNode(NodeRef N) { return N; } \
284 static NodeRef getEntryNode(RegionT *R) { \
288 return nodes_iterator::begin(getEntryNode(R)); \
291 return nodes_iterator::end(getEntryNode(R)); \
300 static NodeRef getEntryNode(RegionT *R) { \
304 return nodes_iterator::begin(getEntryNode(R)); \
307 return nodes_iterator::end(getEntryNode(R)); \
323 static NodeRef getEntryNode(RegionInfo *RI) {
324 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
PostDominators.h 88 static NodeType *getEntryNode(PostDominatorTree *DT) {
93 if (getEntryNode(N))
94 return df_begin(getEntryNode(N));
96 return df_end(getEntryNode(N));
100 return df_end(getEntryNode(N));
RegionIterator.h 269 static NodeType *getEntryNode(NodeType* N) { return N; } \
280 static NodeType *getEntryNode(NodeType* N) { return N; } \
293 static NodeType *getEntryNode(RegionT* R) { \
297 return nodes_iterator::begin(getEntryNode(R)); \
300 return nodes_iterator::end(getEntryNode(R)); \
307 static NodeType *getEntryNode(RegionT* R) { \
311 return nodes_iterator::begin(getEntryNode(R)); \
314 return nodes_iterator::end(getEntryNode(R)); \
329 static NodeType *getEntryNode(RegionInfo *RI) {
330 return GraphTraits<FlatIt<Region*> >::getEntryNode(RI->getTopLevelRegion())
    [all...]
  /external/llvm/include/llvm/ADT/
GraphTraits.h 33 // static NodeType *getEntryNode(const GraphType &)
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
92 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
GraphTraits.h 33 // static NodeType *getEntryNode(const GraphType &)
88 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
89 return GraphTraits<T>::getEntryNode(G->Graph.Graph);
  /external/swiftshader/third_party/LLVM/include/llvm/Support/
DataFlow.h 30 static NodeType *getEntryNode(const Value *G) {
47 static NodeType *getEntryNode(Value *G) {
64 static NodeType *getEntryNode(Inverse<const User*> G) {
85 static NodeType *getEntryNode(Inverse<User*> G) {
  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 173 static NodeType *getEntryNode(NodeType *N) {
186 return df_begin(getEntryNode(N));
190 return df_end(getEntryNode(N));
196 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
201 return df_begin(getEntryNode(N));
205 return df_end(getEntryNode(N));
  /external/llvm/include/llvm/CodeGen/
MachineRegionInfo.h 148 static NodeType *getEntryNode(MachineRegionInfo *RI) {
149 return GraphTraits<FlatIt<MachineRegion*> >::getEntryNode(RI->getTopLevelRegion());
152 return nodes_iterator::begin(getEntryNode(RI));
155 return nodes_iterator::end(getEntryNode(RI));
164 static NodeType *getEntryNode(MachineRegionInfoPass *RI) {
165 return GraphTraits<MachineRegionInfo*>::getEntryNode(&RI->getRegionInfo());

Completed in 829 milliseconds

1 2 3 4 5 6 7 8 91011>>