From 1fd02bc228441fd84d12e53f1094df8f0d238610 Mon Sep 17 00:00:00 2001
From: Chandler Carruth <chandlerc@gmail.com>
Date: Tue, 4 Mar 2014 11:33:42 +0000
Subject: [PATCH] [Modules] Delete DataFlow.h rather than move it to the IR
 library. No 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
---
 include/llvm/Support/DataFlow.h | 103 --------------------------------
 1 file changed, 103 deletions(-)
 delete mode 100644 include/llvm/Support/DataFlow.h

diff --git a/include/llvm/Support/DataFlow.h b/include/llvm/Support/DataFlow.h
deleted file mode 100644
index a09ccaac278..00000000000
--- a/include/llvm/Support/DataFlow.h
+++ /dev/null
@@ -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