Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for sink_node (0.14 sec)

  1. tensorflow/compiler/jit/build_xla_ops_pass_test.cc

      call->AddAttr(kXlaHasReferenceVarsAttr, false);
    
      std::unique_ptr<Graph> graph;
      TF_ASSERT_OK(BuildXlaOps(root, fdef_lib, &graph));
    
      Node* sink_node = graph->sink_node();
      EXPECT_THAT(sink_node,
                  NodeWith(CtrlDeps(NodeWith(Op("_XlaRun")),
                                    NodeWith(Op("StatefulPartitionedCall")),
                                    NodeWith(Op("NoOp")))));
    }
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Feb 22 08:47:20 UTC 2024
    - 12.2K bytes
    - Viewed (0)
  2. tensorflow/compiler/jit/extract_outside_compilation_pass.cc

        FixupSourceAndSinkEdges(host_fbody->graph);
    
        std::map<const Node*, Node*> node_map;
        node_map[host_fbody->graph->source_node()] = (*host_graph)->source_node();
        node_map[host_fbody->graph->sink_node()] = (*host_graph)->sink_node();
        Status s;
        ReverseDFS(
            *host_fbody->graph, /*enter=*/nullptr,
            [&](const Node* n) {
              if (!s.ok()) {
                return;
              }
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 104.7K bytes
    - Viewed (0)
  3. tensorflow/compiler/jit/encapsulate_util.cc

      for (const Edge* e : g->source_node()->out_edges()) {
        if (HasNodeAttr(e->dst()->def(), outside_compilation_attr_name)) {
          edges_to_remove.push_back(e);
        }
      }
      for (const Edge* e : g->sink_node()->in_edges()) {
        if (HasNodeAttr(e->src()->def(), outside_compilation_attr_name)) {
          edges_to_remove.push_back(e);
        }
      }
      for (auto e : edges_to_remove) {
        g->RemoveEdge(e);
      }
    
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 15.5K bytes
    - Viewed (0)
  4. tensorflow/compiler/jit/encapsulate_subgraphs_pass.cc

        const Graph& graph, const std::vector<Node*>& sink_nodes,
        std::unique_ptr<Graph>* pruned_graph,
        absl::flat_hash_map<const Node*, Node*>* node_images,
        FunctionLibraryDefinition* library) {
      // First copy all ancestor nodes of sink_nodes into a new graph.
      pruned_graph->reset(new Graph(library));
      (*pruned_graph)->set_versions(graph.versions());
      ReverseDFSFrom(graph, sink_nodes,
                     /*enter=*/nullptr,
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Feb 22 08:47:20 UTC 2024
    - 51K bytes
    - Viewed (0)
  5. tensorflow/compiler/jit/build_xla_ops_pass.cc

      }
    
      if (ctrl_edges.size() == 1 && ctrl_edges.front()->dst()->IsSink()) {
        // Avoid creating a Merge node if we can just add an edge to _SINK
        // instead.
        s.graph()->AddControlEdge(new_node, s.graph()->sink_node());
        return;
      }
    
      // We can't merge control edges directly so we instead first "convert" them to
      // normal values that can be merged, merge the values and then "convert" the
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Mar 12 06:33:33 UTC 2024
    - 24.3K bytes
    - Viewed (0)
  6. platforms/ide/ide/src/main/java/org/gradle/plugins/ide/eclipse/model/Project.java

            for (Node linkNode : getChildren(findFirstChildNamed(getXml(), "linkedResources"), "link")) {
                Node nameNode = findFirstChildNamed(linkNode, "name");
                Node typeNode = findFirstChildNamed(linkNode, "type");
                Node locationNode = findFirstChildNamed(linkNode, "location");
                Node locationUriNode = findFirstChildNamed(linkNode, "locationURI");
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Dec 11 13:37:56 UTC 2023
    - 16.5K bytes
    - Viewed (0)
  7. tensorflow/compiler/mlir/tensorflow/translate/import_model.cc

                                     true /* skip test for duplicates */);
            }
            if (placeholder_node->out_edges().empty()) {
              graph_->AddControlEdge(placeholder_node, graph_->sink_node(),
                                     true /* skip test for duplicates */);
            }
            remapped_feeds_[{it.first, index}] = placeholder_node->name();
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Wed May 01 11:17:36 UTC 2024
    - 183.2K bytes
    - Viewed (0)
Back to top