| /aosp_15_r20/external/executorch/backends/vulkan/_passes/ |
| H A D | remove_local_scalar_dense_ops.py | 63 replace_node = node.args[0]
64 assert isinstance(replace_node, torch.fx.Node)
70 replace_node.op == "call_function"
71 and replace_node.target == exir_ops.edge.aten.select_copy.int
74 if replace_node.args[0].meta["val"].numel() == 1:
75 replace_node = replace_node.args[0]
76 assert isinstance(replace_node, torch.fx.Node)
77 assert replace_node.meta.get("vkdg_is_scalar_tensor", True)
80 node.replace_all_uses_with(replace_node)
|
| /aosp_15_r20/external/tensorflow/tensorflow/tools/graph_transforms/ |
| H A D | remove_nodes.cc | 73 const NodeDef& replace_node = match.node; in RemoveNodes() local
76 if (required_nodes.count(replace_node.name())) { in RemoveNodes()
77 LOG(INFO) << "Skipping replacement for " << replace_node.name(); in RemoveNodes()
83 for (const string& input : replace_node.input()) { in RemoveNodes()
92 inputs_to_rename[replace_node.name()] = target_name; in RemoveNodes()
93 inputs_to_rename["^" + replace_node.name()] = in RemoveNodes()
|
| /aosp_15_r20/external/llvm-libc/src/__support/ |
| H A D | freetrie.cpp | 27 replace_node(node, nullptr); in remove()
31 replace_node(leaf, nullptr); in remove()
42 replace_node(node, new_node); in remove()
45 void FreeTrie::replace_node(Node *node, Node *new_node) { in replace_node() function in LIBC_NAMESPACE_DECL::FreeTrie
|
| H A D | freetrie.h | 114 void replace_node(Node *node, Node *new_node);
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/jit/ |
| H A D | encapsulate_util.cc | 245 TF_ASSIGN_OR_RETURN(Node * replace_node, ReplaceNode(g, dst, new_def)); in PostprocessDataEdgesBetweenOutsideCompilations()
248 TF_RETURN_IF_ERROR(replace_node->input_edge(dst_input, &edge_to_replace)); in PostprocessDataEdgesBetweenOutsideCompilations()
250 g->AddEdge(original_node, node_src_output, replace_node, dst_input); in PostprocessDataEdgesBetweenOutsideCompilations()
256 data_edges[j].dst = replace_node; in PostprocessDataEdgesBetweenOutsideCompilations()
262 node_name_index[replace_node->name()] = replace_node; in PostprocessDataEdgesBetweenOutsideCompilations()
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/ |
| D | rbtree_algorithms.hpp | 230 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() function in boost::intrusive::rbtree_algorithms
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
238 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() function in boost::intrusive::rbtree_algorithms
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
|
| D | avltree_algorithms.hpp | 206 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node) in replace_node() function in boost::intrusive::avltree_algorithms
210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
214 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() function in boost::intrusive::avltree_algorithms
216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
|
| D | sgtree_algorithms.hpp | 107 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node);
110 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
| D | treap_algorithms.hpp | 200 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node);
203 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
| D | splaytree_algorithms.hpp | 197 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node);
200 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
|
| D | bstree_algorithms.hpp | 449 …BOOST_INTRUSIVE_FORCEINLINE static void replace_node(node_ptr node_to_be_replaced, node_ptr new_no… in replace_node() function in boost::intrusive::bstree_algorithms
453 replace_node(node_to_be_replaced, base_type::get_header(node_to_be_replaced), new_node); in replace_node()
470 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node) in replace_node() function in boost::intrusive::bstree_algorithms
|
| D | bstree.hpp | 193 void replace_node(iterator replace_this, reference with_this) in replace_node() function
195 node_algorithms::replace_node( get_value_traits().to_node_ptr(*replace_this) in replace_node()
1928 void replace_node(iterator replace_this, reference with_this);
|
| D | bs_set.hpp | 409 void replace_node(iterator replace_this, reference with_this);
903 void replace_node(iterator replace_this, reference with_this);
|
| D | set.hpp | 412 void replace_node(iterator replace_this, reference with_this);
907 void replace_node(iterator replace_this, reference with_this);
|
| D | avl_set.hpp | 412 void replace_node(iterator replace_this, reference with_this);
907 void replace_node(iterator replace_this, reference with_this);
|
| D | splay_set.hpp | 417 void replace_node(iterator replace_this, reference with_this);
928 void replace_node(iterator replace_this, reference with_this);
|
| D | treap_set.hpp | 443 void replace_node(iterator replace_this, reference with_this);
959 void replace_node(iterator replace_this, reference with_this);
|
| D | sg_set.hpp | 410 void replace_node(iterator replace_this, reference with_this);
916 void replace_node(iterator replace_this, reference with_this);
|
| D | rbtree.hpp | 437 void replace_node(iterator replace_this, reference with_this);
|
| D | avltree.hpp | 434 void replace_node(iterator replace_this, reference with_this);
|
| D | splaytree.hpp | 461 void replace_node(iterator replace_this, reference with_this);
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/tf2xla/ |
| H A D | tf2xla_util.cc | 119 TF_ASSIGN_OR_RETURN(Node * replace_node, ReplaceNode(g, dst, replace_def)); in ReplaceEdge()
121 TF_RETURN_IF_ERROR(replace_node->input_edge(dst_input, &usage_edge)); in ReplaceEdge()
123 g->AddEdge(with, with_output, replace_node, dst_input); in ReplaceEdge()
124 return replace_node; in ReplaceEdge()
154 Node * replace_node, in ReplaceSrcOutputUsageWithNode()
160 usages[j].dst_node_id = replace_node->id(); in ReplaceSrcOutputUsageWithNode()
|
| /aosp_15_r20/external/pytorch/torch/csrc/jit/ir/ |
| H A D | ir.cpp | 1366 auto replace_node = graph->insertNode(graph->create(new_symbol, 0)); in replaceWithNewSymbol() local
1368 replace_node->addInput(v); in replaceWithNewSymbol()
1371 auto new_out = replace_node->addOutput()->copyMetadata(v); in replaceWithNewSymbol()
1374 replace_node->copyMetadata(this); in replaceWithNewSymbol()
1375 replace_node->copyAttributes(*this); in replaceWithNewSymbol()
1377 (replace_node->maybeOperator() != nullptr) == had_operator, in replaceWithNewSymbol()
1381 return replace_node; in replaceWithNewSymbol()
|
| /aosp_15_r20/external/e2fsprogs/tests/f_extent_oobounds/ |
| H A D | script | 27 replace_node 15 30 200
|
| /aosp_15_r20/external/e2fsprogs/debugfs/ |
| H A D | extent_cmds.ct | 62 replace_node, replace;
|