Move all of the header files which are involved in modelling the LLVM IR

[oota-llvm.git] / include / llvm / Support / DataFlow.h

diff --git a/include/llvm/Support/DataFlow.h b/include/llvm/Support/DataFlow.h
index 8d0ae0c70c5829dadc2e27e7c56b7b0500224c2c..a09ccaac27893326ba1642347a67e3771e472b17 100644 (file)
--- a/include/llvm/Support/DataFlow.h
+++ b/include/llvm/Support/DataFlow.h
@@ -7,28 +7,27 @@
 //
 //===----------------------------------------------------------------------===//
 //
-// This file defines specializations of GraphTraits that allows Use-Def and 
+// 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/User.h"
-#include "llvm/Value.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 
+// Provide specializations of GraphTraits to be able to treat def-use/use-def
 // chains as graphs
 
-template <> struct GraphTraits<const User*> {
+template <> struct GraphTraits<const Value*> {
   typedef const Value NodeType;
-  typedef Value::use_const_iterator ChildIteratorType;
+  typedef Value::const_use_iterator ChildIteratorType;
 
-  static NodeType *getEntryNode(const User *G) {
+  static NodeType *getEntryNode(const Value *G) {
     return G;
   }
 
@@ -41,11 +40,11 @@ template <> struct GraphTraits<const User*> {
   }
 };
 
-template <> struct GraphTraits<User*> {
+template <> struct GraphTraits<Value*> {
   typedef Value NodeType;
   typedef Value::use_iterator ChildIteratorType;
 
-  static NodeType *getEntryNode(User *G) {
+  static NodeType *getEntryNode(Value *G) {
     return G;
   }