Home
last modified time | relevance | path

Searched refs:num_branches (Results 1 – 11 of 11) sorted by relevance

/external/tensorflow/tensorflow/compiler/xla/tests/
Dconditional_test.cc193 int num_branches = GetParam(); in XLA_TEST_P() local
194 for (int bi = -1; bi <= num_branches; ++bi) { in XLA_TEST_P()
202 std::vector<XlaOp> operands(num_branches, operand); in XLA_TEST_P()
204 branches.reserve(num_branches); in XLA_TEST_P()
205 std::vector<const XlaComputation*> branches_p(num_branches); in XLA_TEST_P()
206 for (int i = 0; i < num_branches; ++i) { in XLA_TEST_P()
213 float expected = 10 * static_cast<float>((bi < 0 || bi >= num_branches) in XLA_TEST_P()
214 ? num_branches - 1 in XLA_TEST_P()
236 int num_branches = GetParam(); in XLA_TEST_P() local
237 for (int bi = -1; bi <= num_branches; ++bi) { in XLA_TEST_P()
[all …]
/external/tensorflow/tensorflow/compiler/tf2xla/kernels/
Dcase_op.cc86 int num_branches = branches.size(); in Compile() local
123 num_branches); in Compile()
124 std::vector<const FunctionBody*> case_bodies(num_branches); in Compile()
125 for (int branch_idx = 0; branch_idx < num_branches; branch_idx++) { in Compile()
140 for (int branch_idx = 0; branch_idx < num_branches; branch_idx++) { in Compile()
162 std::vector<XlaCompiler::CompilationResult> branch_results(num_branches); in Compile()
163 for (int j = 0; j < num_branches; ++j) { in Compile()
199 for (int j = 0; j < num_branches; ++j) { in Compile()
208 std::vector<const xla::XlaComputation*> result_computations(num_branches); in Compile()
209 for (int j = 0; j < num_branches; ++j) { in Compile()
[all …]
/external/tensorflow/tensorflow/core/common_runtime/
Dlower_case_op.cc278 int num_branches = branches_attr->list().func_size(); in RewriteCaseNode() local
280 branch_fn_names.reserve(num_branches); in RewriteCaseNode()
281 for (int b = 0; b < num_branches; b++) { in RewriteCaseNode()
/external/tensorflow/tensorflow/compiler/mlir/xla/transforms/
Dlegalize_tf_control_flow.cc133 SmallVector<Value, 4> n_tuple_inputs(op.num_branches(), tuple_input); in LowerCase()
141 for (unsigned i = 0; i < op.num_branches(); ++i) { in LowerCase()
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_verifier.cc950 const int num_branches = conditional->branch_count(); in HandleConditional() local
953 TF_RET_CHECK(num_branches == 2); in HandleConditional()
962 TF_RET_CHECK(num_branches >= 1); in HandleConditional()
964 TF_RETURN_IF_ERROR(CheckOperandCount(conditional, num_branches + 1)); in HandleConditional()
965 for (int j = 0; j < num_branches; ++j) { in HandleConditional()
/external/vixl/test/
Dtest-pool-manager.cc655 int num_branches, in AddNBranches() argument
660 for (int i = 0; i < num_branches; ++i) { in AddNBranches()
/external/tensorflow/tensorflow/compiler/mlir/xla/
Dhlo_function_importer.cc534 int num_branches = instruction->branch_count(); in ImportInstructionImpl() local
536 loc, rets, operands, attributes, num_branches); in ImportInstructionImpl()
/external/tensorflow/tensorflow/compiler/mlir/hlo/lib/Dialect/mhlo/IR/
Dhlo_ops.cc2096 auto num_branches = op.branches().size(); in Verify() local
2097 if (op.branch_operands().size() != num_branches) in Verify()
2098 return op.emitOpError() << "expects number of branches " << num_branches in Verify()
2104 for (unsigned i = 0; i < num_branches; ++i) { in Verify()
/external/tensorflow/tensorflow/compiler/xla/service/cpu/
Dir_emitter.cc2635 int num_branches = conditional->branch_count(); in HandleConditional() local
2642 for (int b = 0; b < num_branches; ++b) { in HandleConditional()
2716 EmitGlobalCall(*conditional->branch_computation(num_branches - 1), in HandleConditional()
2723 b_.CreateSwitch(branch_index_value, default_block, num_branches - 1); in HandleConditional()
2725 for (int b = 0; b < num_branches - 1; ++b) { // last branch is default in HandleConditional()
/external/tensorflow/tensorflow/compiler/mlir/tensorflow/ir/
Dtf_ops_a_m.cc745 if (index < 0 || index >= op.num_branches()) index = op.num_branches() - 1; in matchAndRewrite()
Dtf_ops.td124 int num_branches() { return branches().size(); }
134 functions.reserve(num_branches());
135 for (int idx : llvm::seq<int>(0, num_branches()))