Lines Matching refs:gdef
190 GraphDef* gdef, const Edge* edge,
216 NodeDef* cast = gdef->add_node();
232 NodeDef* send = gdef->add_node();
238 GraphDef* gdef, const Edge* edge, NodeDef** real_recv,
265 NodeDef* recv = gdef->add_node();
277 NodeDef* cast = gdef->add_node();
286 NodeDef* id = gdef->add_node();
295 NodeDef* AddDummyConst(const PartitionOptions& opts, GraphDef* gdef,
299 NodeDef* result = gdef->add_node();
309 NodeDef* AddControlTrigger(const PartitionOptions& opts, GraphDef* gdef,
312 NodeDef* result = gdef->add_node();
769 const GraphDef* gdef, std::vector<std::pair<const NodeDef*, int64>>* nodes,
784 for (int n = 0; n < gdef->node_size(); ++n) {
785 const NodeDef* ndef = &gdef->node(n);
802 for (int n = 0; n < gdef->node_size(); ++n) {
803 const NodeDef* ndef = &gdef->node(n);
818 start_times.reserve(gdef->node_size());
850 GraphDef* gdef = &part.second;
853 status = TopologicalSortNodesWithTimePriority(gdef, &start_times,
861 string device_name = gdef->node(0).device();
872 NodeDef* dummy = AddControlTrigger(opts, gdef, device_name, i,
887 for (int n = 0; n < gdef->node_size(); ++n) {
888 NodeDef* ndef = gdef->mutable_node(n);
925 // 'gdef', if possible.
926 void SetIncarnation(const PartitionOptions& opts, GraphDef* gdef) {
927 for (NodeDef& ndef : *gdef->mutable_node()) {
930 for (FunctionDef& fdef : *gdef->mutable_library()->mutable_function()) {
1178 GraphDef* gdef = &it.second;
1179 *gdef->mutable_versions() = g->versions();
1180 *gdef->mutable_library() = flib_def->ToProto();
1184 SetIncarnation(opts, gdef);
