6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-11-02 07:11:49 +00:00
Code Issues Projects Releases Wiki Activity

[Modules] Delete DataFlow.h rather than move it to the IR library. No

Browse Source 
one in the tree (or in Polly) is using this.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@202825 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth 2014-03-04 11:33:42 +00:00
parent 7225e27b4c
commit 1fd02bc228
1 changed files with 0 additions and 103 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

103
include/llvm/Support/DataFlow.h
View File

@ -1,103 +0,0 @@
//===-- llvm/Support/DataFlow.h - dataflow as graphs ------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file defines specializations of GraphTraits that allows Use-Def and
// Def-Use relations to be treated as proper graphs for generic algorithms.
//===----------------------------------------------------------------------===//
#ifndef LLVM_SUPPORT_DATAFLOW_H
#define LLVM_SUPPORT_DATAFLOW_H
#include "llvm/ADT/GraphTraits.h"
#include "llvm/IR/User.h"
namespace llvm {
//===----------------------------------------------------------------------===//
// Provide specializations of GraphTraits to be able to treat def-use/use-def
// chains as graphs
template <> struct GraphTraits<const Value*> {
typedef const Value NodeType;
typedef Value::const_use_iterator ChildIteratorType;
static NodeType *getEntryNode(const Value *G) {
return G;
}
static inline ChildIteratorType child_begin(NodeType *N) {
return N->use_begin();
}
static inline ChildIteratorType child_end(NodeType *N) {
return N->use_end();
}
};
template <> struct GraphTraits<Value*> {
typedef Value NodeType;
typedef Value::use_iterator ChildIteratorType;
static NodeType *getEntryNode(Value *G) {
return G;
}
static inline ChildIteratorType child_begin(NodeType *N) {
return N->use_begin();
}
static inline ChildIteratorType child_end(NodeType *N) {
return N->use_end();
}
};
template <> struct GraphTraits<Inverse<const User*> > {
typedef const Value NodeType;
typedef User::const_op_iterator ChildIteratorType;
static NodeType *getEntryNode(Inverse<const User*> G) {
return G.Graph;
}
static inline ChildIteratorType child_begin(NodeType *N) {
if (const User *U = dyn_cast<User>(N))
return U->op_begin();
return NULL;
}
static inline ChildIteratorType child_end(NodeType *N) {
if(const User *U = dyn_cast<User>(N))
return U->op_end();
return NULL;
}
};
template <> struct GraphTraits<Inverse<User*> > {
typedef Value NodeType;
typedef User::op_iterator ChildIteratorType;
static NodeType *getEntryNode(Inverse<User*> G) {
return G.Graph;
}
static inline ChildIteratorType child_begin(NodeType *N) {
if (User *U = dyn_cast<User>(N))
return U->op_begin();
return NULL;
}
static inline ChildIteratorType child_end(NodeType *N) {
if (User *U = dyn_cast<User>(N))
return U->op_end();
return NULL;
}
};
}
#endif