Home
last modified time | relevance | path

Searched refs:graph_node (Results 1 – 4 of 4) sorted by relevance

/aosp_15_r20/external/executorch/backends/xnnpack/runtime/
H A DXNNCompiler.cpp531 auto graph_node = node->xnode_union_as_XNNAdd(); in defineAddNode() local
536 remapped_ids.at(graph_node->input1_id()), in defineAddNode()
537 remapped_ids.at(graph_node->input2_id()), in defineAddNode()
538 remapped_ids.at(graph_node->output_id()), in defineAddNode()
539 graph_node->flags()); in defineAddNode()
560 auto graph_node = node->xnode_union_as_XNNMinimum(); in defineMinimumNode() local
563 remapped_ids.at(graph_node->input1_id()), in defineMinimumNode()
564 remapped_ids.at(graph_node->input2_id()), in defineMinimumNode()
565 remapped_ids.at(graph_node->output_id()), in defineMinimumNode()
566 graph_node->flags()); in defineMinimumNode()
[all …]
/aosp_15_r20/external/iproute2/tc/
H A Dtc_class.c29 struct graph_node { struct
33 struct graph_node *parent_node; argument
34 struct graph_node *right_node; argument
165 struct graph_node *node = calloc(1, sizeof(struct graph_node)); in graph_node_add()
182 static void graph_indent(char *buf, struct graph_node *node, int is_newline, in graph_indent()
228 struct graph_node *cls = container_of(n, struct graph_node, in graph_cls_show()
232 struct graph_node *child = container_of(c, in graph_cls_show()
233 struct graph_node, hlist); in graph_cls_show()
/aosp_15_r20/external/pytorch/torch/csrc/jit/backends/xnnpack/compiler/
H A Dxnn_compiler.cpp84 auto graph_node = node->xnode_as_XNNAdd(); in compileModel() local
89 remapped_ids.at(graph_node->input1_id()), in compileModel()
90 remapped_ids.at(graph_node->input2_id()), in compileModel()
91 remapped_ids.at(graph_node->output_id()), in compileModel()
92 graph_node->flags()); in compileModel()
/aosp_15_r20/external/pytorch/torch/ao/quantization/pt2e/
H A Dqat_utils.py515 for pattern_node, graph_node in nodes_map.items():
517 if graph_node is None:
522 new_nodes_map[pattern_node] = graph_node