text: // Copyright 2018 Google LLC
  //
  // Licensed under the Apache License, Version 2.0 (the "License");
  // you may not use this file except in compliance with the License.
  // You may obtain a copy of the License at
  //
  //     https://www.apache.org/licenses/LICENSE-2.0
  //
  // Unless required by applicable law or agreed to in writing, software
  // distributed under the License is distributed on an "AS IS" BASIS,
  // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  // See the License for the specific language governing permissions and
  // limitations under the License.
  
  #ifndef REIL_FLOW_GRAPH_EDGE_H_
  
  #include <iostream>
  
  #include "flow_graph/node.h"
  
  namespace reil {
  enum class EdgeKind {
    kInvalid,
    kFlow,
    kJump,
    kNativeFlow,
    kNativeJump,
    kNativeCall,
    kNativeReturn,
    kNativeBreak,
  };
  
  struct Edge {
    Node source;
    Node target;
    EdgeKind kind;
  
    Edge();
    Edge(Node source, Node target, EdgeKind kind);
  };
  
  bool operator==(const Edge& lhs, const Edge& rhs);
  bool operator!=(const Edge& lhs, const Edge& rhs);
  bool operator<(const Edge& lhs, const Edge& rhs);
  bool operator>(const Edge& lhs, const Edge& rhs);
  bool operator<=(const Edge& lhs, const Edge& rhs);
  bool operator>=(const Edge& lhs, const Edge& rhs);
  std::ostream& operator<<(std::ostream& stream, const Edge& edge);
  }  // namespace reil
  
  #define REIL_FLOW_GRAPH_EDGE_H_
  #endif  // REIL_FLOW_GRAPH_EDGE_H_
  