Searched refs:node_outputs (Results 1 – 8 of 8) sorted by relevance
72 std::unordered_map<string, std::set<int>> node_outputs; in InsertLogging() local86 node_outputs[name].insert(output_index); in InsertLogging()96 if (node_outputs[node.name()].empty()) { in InsertLogging()130 for (int output_index : node_outputs[node.name()]) { in InsertLogging()
44 auto node_outputs = graph->FindOutputs(node->id); in ApplyToNode() local45 for (auto output_value : node_outputs) { in ApplyToNode()
145 TfLiteIntArray* node_outputs = node.outputs; in PlanAllocations() local146 for (int j = 0; j < node_outputs->size; ++j) { in PlanAllocations()147 int tensor_index = node_outputs->data[j]; in PlanAllocations()
163 TfLiteIntArray* node_outputs = node.outputs; in PlanAllocations() local164 for (int j = 0; j < node_outputs->size; ++j) { in PlanAllocations()165 int tensor_index = node_outputs->data[j]; in PlanAllocations()
297 node_outputs = tuple(node.outputs()) # type: ignore[possibly-undefined]298 assert len(node_outputs) == n_outputs
57 auto node_outputs = graph->FindOutputs(node->id); in ApplyToNode() local
509 std::set<Value*> node_outputs(n->outputs().begin(), n->outputs().end()); in unmergeNode() local527 if (node_outputs.count(subgraph->outputs().at(i)) != 0) { in unmergeNode()
531 node_outputs = set(node.outputs.items())532 duplicates = outputs & node_outputs534 outputs |= node_outputs