Home
last modified time | relevance | path

Searched full:tupleunpack (Results 1 – 25 of 31) sorted by relevance

12

/aosp_15_r20/external/pytorch/torch/csrc/jit/passes/
H A Dlower_tuples.cpp23 prim::TupleUnpack,
103 if (n->kind() != prim::TupleUnpack && n->kind() != prim::TupleIndex && in removeTupleNodes()
115 if (n->kind() == prim::TupleUnpack) { in removeTupleNodes()
273 if (n->kind() == prim::TupleUnpack || n->kind() == prim::TupleIndex || in VisitNode()
H A Dlower_tuples.h7 // removes tuples where TupleConstruct and TupleUnpack are matched
H A Dlift_closures.cpp28 subgraph->insertNode(subgraph->create(prim::TupleUnpack, {context}, 0)); in liftClosure()
/aosp_15_r20/external/pytorch/torch/csrc/jit/runtime/
H A Doperator.cpp214 prim::TupleUnpack, prim::CreateObject, prim::GetAttr, in printerHasSpecialCaseFor()
304 prim::TupleUnpack, in aliasAnalysisHasSpecialCaseFor()
H A Dvararg_functions.h10 void tupleUnpack(Stack& stack);
H A Dvararg_functions.cpp103 void tupleUnpack(Stack& stack) { in tupleUnpack() function
H A Dprofiling_graph_executor_impl.cpp433 // TupleConstruct / TupleUnpack pairs can still be present at this point in runNoGradOptimizations()
H A Dgraph_executor.cpp940 // TupleConstruct / TupleUnpack pairs can still be present at this point in runNondiffOptimization()
H A Dautodiff.cpp128 // will be cleaned up later using EliminateDeadCode(block). TupleUnPack node in
H A Dregister_prim_ops.cpp280 TORCH_SELECTIVE_SCHEMA("prim::TupleUnpack(Any tup) -> ..."),
281 [](Stack& stack) { tupleUnpack(stack); }, in __anonbfe5918f0b02()
/aosp_15_r20/external/pytorch/test/mobile/model_test/
H A Dcoverage.yaml649 - prim::TupleUnpack
1018 prim::TupleUnpack: 120
H A Dmodel_ops.yaml404 prim::TupleUnpack: 235
/aosp_15_r20/external/pytorch/aten/src/ATen/core/
H A Dinterned_strings.h89 _(prim, TupleUnpack) \
/aosp_15_r20/external/pytorch/test/jit/
H A Dtest_profiler.py214 FileCheck().check("CallFunction").check_next("Tensor = prim::TupleUnpack").run(
H A Dtest_freezing.py2016 # Check if prim::TupleConstruct and prim::TupleUnpack
2019 FileCheck().check_not("prim::TupleUnpack").run(mf.graph)
/aosp_15_r20/external/pytorch/torch/csrc/jit/codegen/cuda/
H A DREADME.md70 …28, 512, strides=[2097152, 65536, 512, 1], requires_grad=0, device=cuda:0) = prim::TupleUnpack(%19)
/aosp_15_r20/external/pytorch/torch/csrc/jit/runtime/static/
H A Dnative_ops.cpp78 prim::TupleUnpack,
81 if (!sr_schema_check_kind(n, prim::TupleUnpack)) { in __anon75e5f0510502()
H A Dpasses.cpp493 if (cur_node->kind() == prim::TupleUnpack) { in CollectVariadicTupleUnpackFusionCandidates()
515 node->kind() == prim::TupleUnpack && node->inputs().size() == 1); in FuseTupleUnpackBlock()
/aosp_15_r20/external/pytorch/torch/csrc/autograd/
H A Dpython_function.cpp955 // Skip TupleUnpack node if created in _append_subgraph()
1063 // If TupleUnpack operator is created, we copy its output type back in _trace_post_record()
/aosp_15_r20/external/pytorch/
H A Dpt_ops.bzl175 "prim::TupleUnpack",
/aosp_15_r20/external/pytorch/benchmarks/static_runtime/
H A Dtest_static_runtime.cc2254 TEST(StaticRuntime, TupleUnpack) { in TEST() argument
2832 EXPECT_FALSE(hasNodeWithKind(smodule, "prim::TupleUnpack")); in TEST()
2858 // computation between the TupleUnpack nodes. in TEST()
2862 EXPECT_TRUE(hasNodeWithKind(smodule, "prim::TupleUnpack")); in TEST()
H A Dtest_static_module.cc1238 %b_alias : Tensor, %c_alias : Tensor = prim::TupleUnpack(%tuple) in TEST()
/aosp_15_r20/external/pytorch/torch/csrc/jit/serialization/
H A Dpython_print.cpp802 case prim::TupleUnpack: in printNode()
806 // TupleUnpack(unpacked) turns into an assignment op that forces in printNode()
/aosp_15_r20/external/pytorch/torch/csrc/jit/passes/quantization/
H A Dhelper.cpp364 } else if (n->kind() == prim::ListUnpack || n->kind() == prim::TupleUnpack) { in getPassThroughInputs()
/aosp_15_r20/external/pytorch/torch/csrc/jit/ir/
H A Dalias_analysis.cpp691 case prim::TupleUnpack: in analyzeImpl()

12