| /external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/cares/cares/src/lib/ |
| D | ares_llist.c | 47 struct list_node* old_node) { in ares__insert_in_list() argument
48 new_node->next = old_node; in ares__insert_in_list()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
|
| D | ares_llist.h | 35 struct list_node* old_node);
|
| /external/pytorch/torch/csrc/jit/passes/onnx/pattern_conversion/ |
| D | pattern_conversion.cpp | 288 Node* old_node, in ConvertIndexPutToONNX() argument
291 if (old_node->kind() != Symbol::fromQualString("onnx::Placeholder") || in ConvertIndexPutToONNX()
292 (old_node->s(attr::name) != "index_put" && in ConvertIndexPutToONNX()
293 old_node->s(attr::name) != "index_put_")) { in ConvertIndexPutToONNX()
297 TORCH_INTERNAL_ASSERT(old_node->blocks().size() == 1); in ConvertIndexPutToONNX()
298 auto old_graph = old_node->owningGraph(); in ConvertIndexPutToONNX()
299 auto subblock = old_node->blocks()[0]; in ConvertIndexPutToONNX()
311 last_node->replaceInput(0, old_node->input(0)); in ConvertIndexPutToONNX()
376 Node* old_node, in ConvertPatternFromSubblock() argument
381 if (old_node->kind() != Symbol::fromQualString("onnx::Placeholder")) { in ConvertPatternFromSubblock()
[all …]
|
| D | pattern_conversion.h | 41 Node* old_node,
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | build_xla_ops_pass.cc | 65 void MoveOutgoingEdges(Graph* g, Node* old_node, Node* new_node) { in MoveOutgoingEdges() argument
66 std::vector<const Edge*> out_edges(old_node->out_edges().begin(), in MoveOutgoingEdges()
67 old_node->out_edges().end()); in MoveOutgoingEdges()
116 void MergeOutgoingDataEdges(const Scope& s, Node* old_node, Node* new_node, in MergeOutgoingDataEdges() argument
123 std::vector<Output> merged_outputs(old_node->num_outputs(), Output(nullptr)); in MergeOutgoingDataEdges()
126 absl::c_copy_if(old_node->out_edges(), std::back_inserter(data_edges), in MergeOutgoingDataEdges()
142 old_node->name(), " is ")) in MergeOutgoingDataEdges()
161 Output(old_node, oidx), new_output); in MergeOutgoingDataEdges()
176 void MergeOutgoingControlEdges(const Scope& s, Node* old_node, Node* new_node) { in MergeOutgoingControlEdges() argument
182 absl::c_copy_if(old_node->out_edges(), std::back_inserter(ctrl_edges), in MergeOutgoingControlEdges()
[all …]
|
| /external/dtc/ |
| D | livetree.c | 142 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes() argument
148 old_node->deleted = 0; in merge_nodes()
152 add_label(&old_node->labels, l->label); in merge_nodes()
163 delete_property_by_name(old_node, new_prop->name); in merge_nodes()
169 for_each_property_withdel(old_node, old_prop) { in merge_nodes()
187 add_property(old_node, new_prop); in merge_nodes()
200 delete_node_by_name(old_node, new_child->name); in merge_nodes()
206 for_each_child_withdel(old_node, old_child) { in merge_nodes()
216 add_child(old_node, new_child); in merge_nodes()
219 old_node->srcpos = srcpos_extend(old_node->srcpos, new_node->srcpos); in merge_nodes()
[all …]
|
| D | dtc.h | 276 struct node *merge_nodes(struct node *old_node, struct node *new_node);
277 struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
|
| /external/trusty/lk/lib/binary_search_tree/ |
| D | binary_search_tree.c | 97 struct bst_node *old_node, in bst_move_node() argument
100 DEBUG_ASSERT(old_node); in bst_move_node()
102 *bst_parent_ptr(root, old_node) = new_node; in bst_move_node()
104 new_node->parent = old_node->parent; in bst_move_node()
106 old_node->parent = NULL; in bst_move_node()
|
| /external/pytorch/torch/csrc/jit/runtime/static/ |
| D | passes.cpp | 650 auto* const old_node = std::get<0>(tup); in ReplaceWithMaybeCopy() local
654 new_node->insertBefore(old_node); in ReplaceWithMaybeCopy()
655 select_tensor_node->insertBefore(old_node); in ReplaceWithMaybeCopy()
656 new_node->outputs()[0]->copyMetadata(old_node->output()); in ReplaceWithMaybeCopy()
657 select_tensor_node->output()->copyMetadata(old_node->output()); in ReplaceWithMaybeCopy()
658 old_node->replaceAllUsesWith(select_tensor_node); in ReplaceWithMaybeCopy()
659 old_node->destroy(); in ReplaceWithMaybeCopy()
737 auto* old_node = p.first; in ReplaceWithCopyImpl() local
739 new_node->insertBefore(old_node); in ReplaceWithCopyImpl()
740 new_node->output()->copyMetadata(old_node->output()); in ReplaceWithCopyImpl()
[all …]
|
| /external/pytorch/torch/export/experimental/ |
| D | __init__.py | 26 for old_node, new_node in zip(old_phs, new_phs):
27 new_node.name = old_node.name
|
| /external/pytorch/test/export/ |
| D | test_pass_infra.py | 40 for new_node, old_node in zip(new_nodes, old_nodes):
41 self.assertEqual(new_node.op, old_node.op)
42 self.assertEqual(new_node.target, old_node.target)
|
| /external/pytorch/torch/csrc/jit/passes/ |
| D | onnx.cpp | 258 Node* old_node, in NodeToONNX() argument
621 auto k = old_node->kind(); in NodeToONNX()
624 cloneNode(old_node); in NodeToONNX()
626 callPySymbolicMethod(static_cast<ConcretePythonOp*>(old_node)); in NodeToONNX()
628 callPySymbolicFunction(old_node); in NodeToONNX()
|
| D | onnx.h | 20 Node* old_node,
|
| /external/ComputeLibrary/src/graph/mutators/ |
| D | NodeFusionMutator.cpp | 48 void transfer_driving_nodes_and_remove_old_node(Graph &g, INode *new_node, INode *old_node, bool ad… in transfer_driving_nodes_and_remove_old_node() argument
50 if(new_node == nullptr || old_node == nullptr) in transfer_driving_nodes_and_remove_old_node()
56 std::vector<NodeIdxPair> last_driving_nodes = get_driving_nodes(*old_node); in transfer_driving_nodes_and_remove_old_node()
59 if(old_node->output(0) == nullptr) in transfer_driving_nodes_and_remove_old_node()
63 auto old_node_accessor = old_node->output(0)->extract_accessor(); in transfer_driving_nodes_and_remove_old_node()
66 g.remove_node(old_node->id()); in transfer_driving_nodes_and_remove_old_node()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | mkl_layout_pass.cc | 1910 NodeBuilder* nb, const Node* old_node,
2176 NodeBuilder* nb, const Node* old_node, in SetUpContiguousInputs() argument
2190 if (old_node->type_string() == csinfo_.conv2d_grad_input) { in SetUpContiguousInputs()
2195 TF_CHECK_OK(old_node->input_node(kConv2DBackpropInputFilterInputSlotIdx, in SetUpContiguousInputs()
2228 int old_node_input_slots = old_node->op_def().input_arg_size(); in SetUpContiguousInputs()
2236 const OpDef::ArgDef& arg = old_node->op_def().input_arg(on_slot_idx); in SetUpContiguousInputs()
2239 int tensor_list_length = GetTensorListLength(arg, old_node); in SetUpContiguousInputs()
2276 const OpDef::ArgDef& arg = old_node->op_def().input_arg(on_slot_idx); in SetUpContiguousInputs()
2279 int tensor_list_length = GetTensorListLength(arg, old_node); in SetUpContiguousInputs()
2281 GetNodesProducingMklTensorList(g, old_node, old_node_inputs, &iidx, in SetUpContiguousInputs()
[all …]
|
| /external/pytorch/torch/_export/ |
| D | utils.py | 546 def node_replace_(old_node: torch.fx.Node, new_node: torch.fx.Node) -> None:
550 old_node.replace_all_uses_with(new_node)
551 old_node.users.clear()
552 old_node.graph.erase_node(old_node)
|
| /external/tensorflow/tensorflow/tools/graph_transforms/ |
| D | transform_utils.cc | 454 for (const NodeDef& old_node : old_nodes) { in ReplaceMatchingOpTypes() local
456 *added_node = old_node; in ReplaceMatchingOpTypes()
547 for (const NodeDef& old_node : old_nodes) { in CopyOriginalMatch() local
548 new_nodes->push_back(old_node); in CopyOriginalMatch()
|
| /external/cronet/stable/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 2822 const auto transfer_and_delete = [&](node_type *old_node,
2824 new_node->transfer_n(old_node->count(), new_node->start(),
2825 old_node->start(), old_node, alloc);
2826 new_node->set_finish(old_node->finish());
2827 old_node->set_finish(old_node->start());
2828 new_node->set_generation(old_node->generation());
2829 node_type::clear_and_delete(old_node, alloc);
2860 node_type *old_node = iter.node_;
2861 const bool was_rightmost = rightmost() == old_node;
2862 const bool was_leftmost = leftmost() == old_node;
[all …]
|
| /external/abseil-cpp/absl/container/internal/ |
| D | btree.h | 2822 const auto transfer_and_delete = [&](node_type *old_node,
2824 new_node->transfer_n(old_node->count(), new_node->start(),
2825 old_node->start(), old_node, alloc);
2826 new_node->set_finish(old_node->finish());
2827 old_node->set_finish(old_node->start());
2828 new_node->set_generation(old_node->generation());
2829 node_type::clear_and_delete(old_node, alloc);
2860 node_type *old_node = iter.node_;
2861 const bool was_rightmost = rightmost() == old_node;
2862 const bool was_leftmost = leftmost() == old_node;
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 2925 const auto transfer_and_delete = [&](node_type *old_node,
2927 new_node->transfer_n(old_node->count(), new_node->start(),
2928 old_node->start(), old_node, alloc);
2929 new_node->set_finish(old_node->finish());
2930 old_node->set_finish(old_node->start());
2931 new_node->set_generation(old_node->generation());
2932 node_type::clear_and_delete(old_node, alloc);
2963 node_type *old_node = iter.node_;
2964 const bool was_rightmost = rightmost() == old_node;
2965 const bool was_leftmost = leftmost() == old_node;
[all …]
|
| /external/cronet/tot/third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 2822 const auto transfer_and_delete = [&](node_type *old_node,
2824 new_node->transfer_n(old_node->count(), new_node->start(),
2825 old_node->start(), old_node, alloc);
2826 new_node->set_finish(old_node->finish());
2827 old_node->set_finish(old_node->start());
2828 new_node->set_generation(old_node->generation());
2829 node_type::clear_and_delete(old_node, alloc);
2860 node_type *old_node = iter.node_;
2861 const bool was_rightmost = rightmost() == old_node;
2862 const bool was_leftmost = leftmost() == old_node;
[all …]
|
| /external/iamf_tools/gh_pages/web_demo/decoder/wasm/ |
| D | wrapper.js | 9 …old_node,new_dir,new_name){if(FS.isDir(old_node.mode)){var new_node;try{new_node=FS.lookupNode(new…
|
| /external/pytorch/torch/export/ |
| D | exported_program.py | 543 for old_node, new_node in zip(old_placeholders, new_placeholders):
544 if not isinstance(old_node.meta["val"], torch.Tensor):
545 new_node.meta["val"] = old_node.meta["val"]
551 for k, v in old_node.meta.items():
|
| /external/executorch/exir/tests/ |
| D | test_passes.py | 486 for new_node, old_node in zip(new_nodes, old_nodes):
487 self.assertEqual(new_node.op, old_node.op)
488 self.assertEqual(new_node.target, old_node.target)
518 for new_node, old_node in zip(new_nodes, old_nodes):
519 self.assertEqual(new_node.op, old_node.op)
520 self.assertEqual(new_node.target, old_node.target)
|
| /external/selinux/libsemanage/src/ |
| D | pywrap-test.py | 1140 (status, old_node) = semanage.semanage_node_query_local(sh, key)
1173 status = semanage.semanage_node_modify_local(sh, key, old_node)
1188 semanage.semanage_node_free(old_node)
|