H A D | encapsulate_subgraphs_pass.cc | 59 bool AreAllParentsConst(const Node& n, 60 const gtl::FlatSet<const Node*>& runtime_const_nodes) { 82 const std::vector<std::pair<const Node*, Node*>>& src_arg_pairs) { 83 gtl::FlatSet<const Node*> guaranteed_const_nodes; 84 std::vector<const Node*> srcs; 90 /*leave=*/[&guaranteed_const_nodes](const Node* n) { 109 NodeSlot(const Node* node, int slot) 111 NodeSlot(const Node* node, int slot, DataType dtype) 114 const Node* nod 80 MarkGuaranteedConstants( const Graph& graph, const std::vector<std::pair<const Node*, Node*>>& src_arg_pairs) argument 652 RecordArg( const Edge* edge, const std::unordered_map<const Node*, Node*>& node_images, std::vector<std::pair<const Node*, Node*>>* src_arg_pairs) argument 686 RecordResult( const Edge* edge, const std::unordered_map<const Node*, Node*>& node_images) argument 752 AddHostComputes( const string& subgraph_name, const std::unordered_map<const Node*, Node*>& node_images) argument 983 BuildParallelCheckOp( const std::unordered_map<const Node*, Node*>& node_images, Graph* graph_out) argument 1046 AddFunctionCallNode( const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out) argument 1100 AddSendFromHostNode( const std::unordered_map<const Node*, Node*>& node_images, const string& subgraph_name, const string& oc_subgraph_name, OutsideCompilationSubgraph* oc_subgraph, Graph* graph_out) argument 1143 AddOutsideCompilationHostIONodes( const string& subgraph_name, const std::unordered_map<const Node*, Node*>& node_images, Graph* graph_out) argument 1204 CopySubgraphNodes( std::unordered_map<const Node*, Node*>* node_images) argument 1221 CopySubgraphEdges( const std::unordered_map<const Node*, Node*>& node_images, std::vector<std::pair<const Node*, Node*>>* src_arg_pairs) argument 1357 CopyNodesToOutputGraph( bool parallel_checking, Graph* graph_out, std::unordered_map<const Node*, Node*>* node_images) argument 1388 AddFunctionCallNodes( const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out) argument 1398 AddOutsideCompilationHostIONodes( const std::unordered_map<const Node*, Node*>& node_images, Graph* graph_out) argument 1410 FindOutputImageOfEdgeSrc( const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const std::unordered_map<const Node*, Node*>& node_images, const Node* original_src_node, Node** src_image) argument 1458 FindOutputImageOfEdgeDst( const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const std::unordered_map<const Node*, Node*>& node_images, const Node* original_dst_node, Node** dst_image) argument 1506 CopyEdgeToOutputGraph( const Edge* edge, const string& src_func_id, const string& src_outside_compilation_id, const string& dst_func_id, const string& dst_outside_compilation_id, const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out, std::unordered_set<std::pair<NodeSlot, NodeSlot>, NodeSlot::PairHasher>* edges_added) argument 1567 AddEdgesToOutputGraph( const std::unordered_map<const Node*, Node*>& node_images, bool parallel_checking, Graph* graph_out) argument 1800 MakePrunedGraphCopyAndInline( const Graph& graph, const std::vector<Node*>& sink_nodes, std::unique_ptr<Graph>* pruned_graph, std::unordered_map<const Node*, Node*>* node_images, FunctionLibraryDefinition* library) argument 1862 MakeGraphForOutsideCompilationSends( const Graph& graph, std::unique_ptr<Graph>* pruned_graph, ShapeRefiner* shape_refiner, std::unordered_map<const Node*, Node*>* node_images, FunctionLibraryDefinition* library) argument [all...] |