Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for HasForwardedRefInput (0.34 sec)

  1. tensorflow/compiler/jit/xla_cluster_util.h

    extern const char* const kXlaCompileTimeConstantInputsAttr;
    
    using OrderedNodeSet = std::set<Node*, NodeComparatorID>;
    
    // Returns true if `node` has a ref tensor input that it forwards to its output.
    bool HasForwardedRefInput(const Node& node);
    
    // Creates a graph representation to enable cycle detection when clustering.
    // This representation handles loops in graph by disconnecting each loop from
    // the enclosing graph.
    //
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed Feb 21 09:53:30 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  2. tensorflow/compiler/jit/xla_cluster_util.cc

        absl::StrAppend(&description, ascii_art, node_name(node_id), "\n");
      }
      return description;
    }
    
    bool AlwaysForwardsRefInput(const Node& node) { return node.IsIdentity(); }
    
    }  // namespace
    
    bool HasForwardedRefInput(const Node& node) {
      if (AlwaysForwardsRefInput(node)) {
        for (const Edge* incoming_edge : node.in_edges()) {
          if (incoming_edge->IsControlEdge()) {
            continue;
          }
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Feb 29 08:39:39 UTC 2024
    - 21.3K bytes
    - Viewed (0)
  3. tensorflow/compiler/jit/compilability_check_util.cc

      }
    
      // XLA does not offer guaranteed aliasing between the input and output of the
      // XLA cluster so it can't implement the forward-tensor-ref semantic.  Leave
      // such nodes out of XLA clusters.
      if (HasForwardedRefInput(node)) {
        VLOG(2) << "Rejecting " << node.name() << ": Identity with unsafe cast.";
        *uncompilable_reason = "Identity with unsafe cast.";
        return false;
      }
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 30.3K bytes
    - Viewed (0)
Back to top