Searched defs:input_node (Results 1 - 25 of 27) sorted by relevance

12

/external/tensorflow/tensorflow/core/kernels/data/
H A Dzip_dataset_op.cc85 Node* input_node; variable
86 TF_RETURN_IF_ERROR(b->AddParentDataset(ctx, input, &input_node));
87 input_graph_nodes.emplace_back(input_node);
H A Dstats_dataset_ops.cc77 Node* input_node; variable
78 TF_RETURN_IF_ERROR(b->AddParentDataset(ctx, input_, &input_node));
81 TF_RETURN_IF_ERROR(b->AddDataset(this, {input_node, tag_node}, output));
173 Node* input_node; variable
174 TF_RETURN_IF_ERROR(b->AddParentDataset(ctx, input_, &input_node));
177 TF_RETURN_IF_ERROR(b->AddDataset(this, {input_node, tag_node}, output));
H A Ddense_to_sparse_batch_dataset_op.cc120 Node* input_node; variable
121 TF_RETURN_IF_ERROR(b->AddParentDataset(ctx, input_, &input_node));
132 this, {input_node, batch_size_node, row_shape_node}, output));
H A Dinterleave_dataset_op.cc118 Node* input_node; variable
119 TF_RETURN_IF_ERROR(b->AddParentDataset(ctx, input_, &input_node));
141 {{0, input_node}, {2, cycle_length_node}, {3, block_length_node}},
H A Dscan_dataset_op.cc112 Node* input_node; variable
113 TF_RETURN_IF_ERROR(b->AddParentDataset(ctx, input_, &input_node));
138 b->AddDataset(this, {{0, input_node}},
/external/tensorflow/tensorflow/core/distributed_runtime/
H A Dcluster_function_library_runtime.cc47 NodeDef* input_node = g->add_node(); local
57 .Finalize(input_node));
/external/tensorflow/tensorflow/core/graph/
H A Dmkl_tfconversion_pass.cc375 Node* input_node = nullptr; local
376 TF_CHECK_OK(n->input_node(0, &input_node));
379 (input_node->type_string().compare("_MklInputConversion") == 0)) {
H A Dgraph.cc246 Status Node::input_node(int idx, Node** n) const { function in class:tensorflow::Node
257 Status Node::input_node(int idx, const Node** const_n) const { function in class:tensorflow::Node
259 TF_RETURN_IF_ERROR(input_node(idx, &n));
/external/tensorflow/tensorflow/core/grappler/optimizers/
H A Dgraph_rewriter.cc202 const NodeDef* input_node = itr->second->def; local
203 if (nodes_to_delete.find(input_node) != nodes_to_delete.end()) {
204 ForwardInputsInternal(*input_node, nodes_to_delete,
H A Ddependency_optimizer.cc288 NodeDef* input_node = node_map_->GetNode(node->input(i)); local
289 CHECK_NE(input_node, nullptr);
290 input_nodes.push_back(input_node);
445 const NodeDef* input_node = node_map_->GetNode(input); local
446 if (ModifiesFrameInfo(*input_node) || IsMerge(*input_node)) {
451 const int input_node_idx = node_to_idx_[input_node];
H A Dmemory_optimizer.cc88 const NodeDef* input_node = node_map.GetNode(input_name); local
89 if (is_target(*input_node)) {
121 const NodeDef* input_node = node_map.GetNode(input_name_raw); local
122 if (expanded_nodes->count(input_node) == 0 &&
123 is_candidate(*input_node)) {
124 to_visit.push(input_node);
785 const NodeDef* input_node = it1->second; local
787 auto it2 = execution_times.find(input_node);
816 const NodeDef* input_node = it1->second; local
820 if (ModifiesFrameInfo(*input_node) || IsSwitc
[all...]
H A Darithmetic_optimizer.cc255 const NodeDef* input_node = node_map.GetNode(node_name); local
256 return input_node->attr().at(kOutputShapesAttr).list().shape(output_pos);
H A Dconstant_folding.cc741 const NodeDef* input_node = node_map_->GetNode(input); local
742 if (!input_node) {
745 bool is_const = IsReallyConstant(*input_node);
751 if (is_const && input_node->attr().at("dtype").type() == DT_STRING) {
915 const NodeDef* input_node = node_map_->GetNode(input); local
916 if (!IsReallyConstant(*input_node)) {
921 const TensorProto& raw_val = input_node->attr().at("value").tensor();
969 NodeDef* input_node = node_map_->GetNode(input); local
970 if (!IsReallyConstant(*input_node)) {
974 for (const string& fanin_of_input : input_node
1060 NodeDef* input_node = node_map_->GetNode(input); local
[all...]
/external/tensorflow/tensorflow/core/grappler/costs/
H A Dgraph_memory.cc219 string input_node = ParseNodeName(input, &position); local
225 input_node, position, &live_tensors,
226 &live_tensors_per_device[node_placement[input_node]]);
H A Dutils.cc104 const NodeDef* input_node = iter->second; local
110 << "\nInput node: " << input_node->DebugString();
114 if (input_node->op() == "Const" && i < op_info->inputs_size()) {
115 auto it = input_node->attr().find("value");
116 if (it == input_node->attr().end()) continue;
157 attr.set_s(input_node->op());
H A Dvirtual_scheduler.cc380 const NodeDef* input_node = name_to_node[NodeName(input_node_name)]; local
382 CHECK(input_node);
383 const string in_device = DeviceName(input_node);
387 // Same device: connect input_node and curr_node directly.
389 std::make_pair(input_node, input_node_port_num));
390 auto& input_node_state = GetNodeStateOrCreateIt(input_node);
393 RecvNodeDescriptor recv_node(input_node, input_node_port_num,
405 // Different device, no cached copy; transfer input_node to the
408 CreateSendRecv(input_node, curr_node, input_node_name);
415 auto& input_node_state = GetNodeStateOrCreateIt(input_node);
[all...]
/external/tensorflow/tensorflow/tools/graph_transforms/
H A Dfold_old_batch_norms.cc114 const NodeDef& input_node = conv_node_match.inputs[0].node; local
149 new_nodes->push_back(input_node);
265 {"*"}, // input_node
299 {"*"}, // input_node
305 {"*"}, // input_node
H A Dsparsify_gather_test.cc81 NodeDef* input_node = CreateNode("ids", "Const", {}, &graph_def); local
137 MakeGather("gather", gather_v2, identity_node, input_node, &graph_def);
295 NodeDef* input_node = CreateNode("ids", "Const", {}, &graph_def); local
378 MakeGather("gather1", gather_v2, identity_node1, input_node, &graph_def);
379 MakeGather("gather2", gather_v2, identity_node2, input_node, &graph_def);
H A Dtransform_utils.cc343 const NodeDef& input_node = *(node_map_[input_node_name]); local
347 if (!DoesOpTypeMatch(input_node, input_pattern, previously_matched_nodes,
380 for (const NodeDef& input_node : input_graph_def.node()) {
381 if (matches_by_head_name.count(input_node.name())) {
384 const NodeMatch* match = matches_by_head_name[input_node.name()];
456 } else if (!matched_nodes.count(input_node.name())) {
459 *added_node = input_node;
556 string input_node = NodeNameFromInput(input); local
557 if (!node_map.count(input_node)) {
558 invalid_inputs->push_back({node.name(), input_node});
[all...]
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_pair_regalloc.c518 unsigned int i, input_node, node_count, node_index; local
600 for (i = 0, input_node = 0; i< s->NumInputs; i++) {
610 node_count + input_node);
614 ra_set_node_reg(graph, node_count + input_node, get_reg_id(
616 input_node++;
/external/tensorflow/tensorflow/core/profiler/internal/
H A Dtfprof_node.h716 const TFGraphNode* input_node = input_it->second.get(); local
717 if (!input_node) continue;
718 const auto& output_shapes = input_node->output_shapes();
722 if (output_shape != input_node->output_shapes().end()) {
/external/adhd/cras/src/server/
H A Dcras_alsa_io.c2047 struct alsa_input_node *input_node = NULL; local
2074 input_node = new_input(aio, control, section->name);
2075 if (!input_node)
2093 } else if (input_node) {
2094 input_node->jack = jack;
/external/tensorflow/tensorflow/core/kernels/hexagon/
H A Dgraph_transferer.cc121 for (const Node* const input_node : node->in_nodes()) {
122 const string& name = input_node->name();
305 for (const Node* const input_node : node.in_nodes()) {
306 if (node_name_to_id_cache_map_.count(input_node->name()) <= 0) {
307 VLOG(1) << "input_node " << input_node->name() << " of " << node.name()
344 Node* input_node; local
345 TF_RETURN_IF_ERROR(builder.Finalize(graph, &input_node));
346 CHECK_NOTNULL(input_node);
350 shape_refiner->UpdateNode(input_node, fals
726 const Node* input_node = edge->src(); local
869 const Node* input_node = edge->src(); local
[all...]
/external/v8/src/compiler/ia32/
H A Dinstruction-selector-ia32.cc1107 Node* input_node = input.node(); local
1109 if (g.CanBeMemoryOperand(kIA32Push, node, input_node, effect_level)) {
1115 input_node, inputs, &input_count);
/external/v8/src/compiler/x64/
H A Dinstruction-selector-x64.cc1527 Node* input_node = input.node(); local
1528 if (g.CanBeImmediate(input_node)) {
1529 Emit(kX64Push, g.NoOutput(), g.UseImmediate(input_node));
1531 sequence()->IsFP(GetVirtualRegister(input_node))) {
1534 Emit(kX64Push, g.NoOutput(), g.UseRegister(input_node));
1535 } else if (g.CanBeMemoryOperand(kX64Push, node, input_node,
1542 input_node, inputs, &input_count);
1546 Emit(kX64Push, g.NoOutput(), g.Use(input_node));

Completed in 696 milliseconds

12