Home
last modified time | relevance | path

Searched defs:new_nodes (Results 1 – 20 of 20) sorted by relevance

/external/tensorflow/tensorflow/tools/graph_transforms/
Dbackports.cc37 std::vector<NodeDef>* new_nodes) { in BackportConcatV2Transform()
74 std::vector<NodeDef>* new_nodes) { in BackportTensorArrayV3Transform()
120 std::vector<NodeDef>* new_nodes) { in BackportTensorArrayV3Transform()
127 {true}, output_graph_def)); in BackportTensorArrayV3Transform()
Dfuse_convolutions.cc48 std::vector<NodeDef>* new_nodes) { in FuseResizePadAndConv()
97 std::vector<NodeDef>* new_nodes) { in FuseResizeAndConv()
133 {}, &replaced_graph_def)); in FuseResizeAndConv()
157 std::vector<NodeDef>* new_nodes) { in FusePadAndConv()
187 {}, &replaced_graph_def)); in FusePadAndConv()
Dfold_old_batch_norms.cc110 std::vector<NodeDef>* new_nodes) { in FuseScaleOffsetToConvWeights()
177 std::vector<NodeDef>* new_nodes) { in FuseBatchNormWithConv()
193 std::vector<NodeDef>* new_nodes) { in FuseBatchNormWithBatchToSpace()
222 std::vector<NodeDef>* new_nodes) { in FuseBatchNormWithConvConcat()
314 std::vector<NodeDef>* new_nodes) { in FoldOldBatchNorms()
319 {}, &replaced_graph_def)); in FoldOldBatchNorms()
351 std::vector<NodeDef>* new_nodes) { in FoldOldBatchNorms()
356 {}, &replaced_graph_def)); in FoldOldBatchNorms()
394 std::vector<NodeDef>* new_nodes) { in FoldOldBatchNorms()
399 {}, &replaced_graph_def)); in FoldOldBatchNorms()
Dquantize_nodes.cc282 std::vector<NodeDef>* new_nodes) { in RemoveRedundantQuantizations()
302 {true}, &replaced_graph_def)); in RemoveRedundantQuantizations()
405 std::vector<NodeDef>* new_nodes) { in ConvertFakeQuantsToRequantize()
452 {}, output_graph_def)); in ConvertFakeQuantsToRequantize()
499 std::vector<NodeDef>* new_nodes) { in MergeAdjacentRequantizes()
522 {}, output_graph_def)); in MergeAdjacentRequantizes()
549 std::vector<NodeDef>* new_nodes) { in HoistFakeQuants()
578 {}, &hoisted_graph_def)); in HoistFakeQuants()
698 std::vector<NodeDef>* new_nodes) { in QuantizeNodes()
923 {}, &quantized_graph_def)); in QuantizeNodes()
Dfold_batch_norms.cc51 std::vector<NodeDef>* new_nodes) { in FoldBatchNorms()
118 {}, &replaced_graph_def)); in FoldBatchNorms()
Dremove_nodes.cc73 std::vector<NodeDef>* new_nodes) { in RemoveNodes()
100 {true}, &replaced_graph_def)); in RemoveNodes()
Dround_weights.cc42 std::vector<NodeDef>* new_nodes) { in RoundWeights()
107 {}, output_graph_def)); in RoundWeights()
Dquantize_weights.cc45 std::vector<NodeDef>* new_nodes) { in QuantizeWeights()
138 {}, output_graph_def)); in QuantizeWeights()
Dflatten_atrous.cc52 std::vector<NodeDef>* new_nodes) { in FlattenAtrousConv()
132 {}, &replaced_graph_def)); in FlattenAtrousConv()
Dsparsify_gather.cc260 std::vector<NodeDef>* new_nodes) { in SparsifyGatherInternal()
449 {true}, &replaced_graph_def)); in SparsifyGatherInternal()
Dtransform_utils.cc430 std::vector<NodeDef> new_nodes; in ReplaceMatchingOpTypes() local
544 std::vector<NodeDef>* new_nodes) { in CopyOriginalMatch()
Dtransform_utils_test.cc437 std::vector<NodeDef>* new_nodes) { in TestReplaceMatchingOpTypes()
452 {}, &replaced_graph_def)); in TestReplaceMatchingOpTypes()
875 std::vector<NodeDef> new_nodes; in TestCopyOriginalMatch() local
/external/yapf/yapf/yapflib/
Dpytree_utils.py149 def InsertNodesBefore(new_nodes, target): argument
164 def InsertNodesAfter(new_nodes, target): argument
/external/ltp/testcases/kernel/syscalls/migrate_pages/
Dmigrate_pages03.c43 static unsigned long *new_nodes[2]; variable
Dmigrate_pages01.c127 unsigned long *old_nodes, *new_nodes; in test_invalid_nodes() local
Dmigrate_pages02.c77 unsigned long *old_nodes, *new_nodes; in migrate_to_node() local
/external/tensorflow/tensorflow/python/keras/
Dmodels.py63 def _insert_ancillary_layers(model, ancillary_layers, metrics_names, new_nodes): argument
/external/pdfium/third_party/libopenjpeg20/
Dtgt.c179 opj_tgt_node_t* new_nodes = (opj_tgt_node_t*) opj_realloc(p_tree->nodes, in opj_tgt_init() local
/external/tensorflow/tensorflow/core/kernels/boosted_trees/
Dresources.cc455 protobuf::RepeatedPtrField<boosted_trees::Node> new_nodes; in PostPruneTree() local
/external/v8/src/compiler/
Dsimd-scalar-lowering.cc2297 void SimdScalarLowering::ReplaceNode(Node* old, Node** new_nodes, int count) { in ReplaceNode()