Home
last modified time | relevance | path

Searched refs:case_count (Results 1 - 25 of 37) sorted by relevance

12

/third_party/littlefs/runners/
H A Dtest_runner.c807 for (size_t j = 0; j < test_suites[i].case_count; j++) { in summary()
868 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_suites()
915 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_cases()
929 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_cases()
984 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_suite_paths()
1014 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_case_paths()
1026 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_case_paths()
1150 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_defines()
1198 for (size_t j = 0; j < test_suites[i].case_count; j++) { in list_permutation_defines()
1936 for (size_t j = 0; j < test_suites[i].case_count; in run()
[all...]
H A Dbench_runner.c780 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in summary()
839 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_suites()
884 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_cases()
898 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_cases()
951 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_suite_paths()
981 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_case_paths()
993 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_case_paths()
1113 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_defines()
1159 for (size_t j = 0; j < bench_suites[i].case_count; j++) { in list_permutation_defines()
1379 for (size_t j = 0; j < bench_suites[i].case_count; in run()
[all...]
H A Dbench_runner.h73 size_t case_count; member
H A Dtest_runner.h66 size_t case_count; member
/third_party/mbedtls/scripts/mbedtls_dev/
H A Dbignum_core.py810 case_count = 3 if n < 5 else 4
813 while i < case_count:
/third_party/node/deps/v8/src/compiler/
H A Draw-machine-assembler.cc570 size_t case_count) { in Switch()
572 size_t succ_count = case_count + 1; in Switch()
575 for (size_t i = 0; i < case_count; ++i) { in Switch()
588 succ_blocks[case_count] = default_block; in Switch()
567 Switch(Node* index, RawMachineLabel* default_label, const int32_t* case_values, RawMachineLabel** case_labels, size_t case_count) Switch() argument
H A Dcode-assembler.cc1332 size_t case_count) { in Switch()
1333 RawMachineLabel** labels = zone()->NewArray<RawMachineLabel*>(case_count); in Switch()
1334 for (size_t i = 0; i < case_count; ++i) { in Switch()
1340 labels, case_count); in Switch()
1330 Switch(Node* index, Label* default_label, const int32_t* case_values, Label** case_labels, size_t case_count) Switch() argument
H A Dverifier.cc102 int case_count = 0; in CheckSwitch() local
117 ++case_count; in CheckSwitch()
135 CHECK_EQ(node->op()->ControlOutputCount(), case_count + 1); in CheckSwitch()
/third_party/node/deps/v8/src/codegen/loong64/
H A Dmacro-assembler-loong64.h648 void GenerateSwitchTable(Register index, size_t case_count,
1063 void TurboAssembler::GenerateSwitchTable(Register index, size_t case_count, in GenerateSwitchTable() argument
1067 BlockTrampolinePoolFor(3 + case_count); in GenerateSwitchTable()
1072 for (size_t index = 0; index < case_count; ++index) { in GenerateSwitchTable()
/third_party/node/deps/v8/src/codegen/mips64/
H A Dmacro-assembler-mips64.h782 void GenerateSwitchTable(Register index, size_t case_count,
1250 void TurboAssembler::GenerateSwitchTable(Register index, size_t case_count, in GenerateSwitchTable() argument
1254 BlockTrampolinePoolFor(static_cast<int>(case_count) * 2 + in GenerateSwitchTable()
1279 for (size_t index = 0; index < case_count; ++index) { in GenerateSwitchTable()
/third_party/node/deps/v8/src/codegen/mips/
H A Dmacro-assembler-mips.h786 void GenerateSwitchTable(Register index, size_t case_count,
1171 void TurboAssembler::GenerateSwitchTable(Register index, size_t case_count, in GenerateSwitchTable() argument
1174 BlockTrampolinePoolFor(case_count + kSwitchTablePrologueSize); in GenerateSwitchTable()
1192 for (size_t index = 0; index < case_count; ++index) { in GenerateSwitchTable()
/third_party/node/deps/v8/src/codegen/riscv64/
H A Dmacro-assembler-riscv64.h762 void GenerateSwitchTable(Register index, size_t case_count,
1331 void TurboAssembler::GenerateSwitchTable(Register index, size_t case_count, in GenerateSwitchTable() argument
1335 BlockTrampolinePoolFor(static_cast<int>(case_count) * 2 + in GenerateSwitchTable()
1353 for (size_t index = 0; index < case_count; ++index) { in GenerateSwitchTable()
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-selector-impl.h60 size_t case_count() const { return cases_.size(); } in case_count() function in v8::internal::compiler::SwitchInfo
H A Dinstruction-selector.cc1309 size_t case_count = block->SuccessorCount() - 1; in VisitControl() local
1310 ZoneVector<CaseInfo> cases(case_count, zone()); in VisitControl()
1311 for (size_t i = 0; i < case_count; ++i) { in VisitControl()
2496 size_t input_count = 2 + sw.case_count() * 2; in EmitBinarySearchSwitch()
2497 DCHECK_LE(sw.case_count(), (std::numeric_limits<size_t>::max() - 2) / 2); in EmitBinarySearchSwitch()
/third_party/node/deps/v8/src/compiler/backend/ppc/
H A Dcode-generator-ppc.cc3980 int32_t const case_count = static_cast<int32_t>(instr->InputCount() - 2); in AssembleArchTableSwitch() local
3981 Label** cases = zone()->NewArray<Label*>(case_count); in AssembleArchTableSwitch()
3982 for (int32_t index = 0; index < case_count; ++index) { in AssembleArchTableSwitch()
3985 Label* const table = AddJumpTable(cases, case_count); in AssembleArchTableSwitch()
3986 __ CmpU64(input, Operand(case_count), r0); in AssembleArchTableSwitch()
H A Dinstruction-selector-ppc.cc1769 size_t lookup_space_cost = 3 + 2 * sw.case_count(); in VisitSwitch()
1770 size_t lookup_time_cost = sw.case_count(); in VisitSwitch()
1771 if (sw.case_count() > 0 && in VisitSwitch()
/third_party/node/deps/v8/src/compiler/backend/ia32/
H A Dcode-generator-ia32.cc3865 size_t const case_count = instr->InputCount() - 2; in AssembleArchTableSwitch() local
3866 Label** cases = zone()->NewArray<Label*>(case_count); in AssembleArchTableSwitch()
3867 for (size_t index = 0; index < case_count; ++index) { in AssembleArchTableSwitch()
3870 Label* const table = AddJumpTable(cases, case_count); in AssembleArchTableSwitch()
3871 __ cmp(input, Immediate(case_count)); in AssembleArchTableSwitch()
/third_party/node/deps/v8/src/compiler/backend/s390/
H A Dcode-generator-s390.cc3348 int32_t const case_count = static_cast<int32_t>(instr->InputCount() - 2); in AssembleArchTableSwitch() local
3349 Label** cases = zone()->NewArray<Label*>(case_count); in AssembleArchTableSwitch()
3350 for (int32_t index = 0; index < case_count; ++index) { in AssembleArchTableSwitch()
3353 Label* const table = AddJumpTable(cases, case_count); in AssembleArchTableSwitch()
3354 __ CmpU64(input, Operand(case_count)); in AssembleArchTableSwitch()
H A Dinstruction-selector-s390.cc1987 size_t lookup_space_cost = 3 + 2 * sw.case_count(); in VisitSwitch()
1988 size_t lookup_time_cost = sw.case_count(); in VisitSwitch()
1989 if (sw.case_count() > 0 && in VisitSwitch()
/third_party/node/deps/v8/src/compiler/backend/mips/
H A Dinstruction-selector-mips.cc1753 size_t lookup_space_cost = 2 + 2 * sw.case_count(); in VisitSwitch()
1754 size_t lookup_time_cost = sw.case_count(); in VisitSwitch()
1755 if (sw.case_count() > 0 && in VisitSwitch()
/third_party/node/deps/v8/src/compiler/backend/loong64/
H A Dcode-generator-loong64.cc2168 size_t const case_count = instr->InputCount() - 2; in AssembleArchTableSwitch() local
2170 __ Branch(GetLabel(i.InputRpo(1)), hs, input, Operand(case_count)); in AssembleArchTableSwitch()
2171 __ GenerateSwitchTable(input, case_count, [&i, this](size_t index) { in AssembleArchTableSwitch()
/third_party/node/deps/v8/src/compiler/backend/arm64/
H A Dcode-generator-arm64.cc2989 size_t const case_count = instr->InputCount() - 2; in AssembleArchInstruction()
2991 __ Cmp(input, case_count); in AssembleArchInstruction()
3002 case_count * kInstrSize); in AssembleArchInstruction()
3004 for (size_t index = 0; index < case_count; ++index) { in AssembleArchInstruction()
/third_party/node/deps/v8/src/compiler/backend/arm/
H A Dcode-generator-arm.cc3648 size_t const case_count = instr->InputCount() - 2; in AssembleArchInstruction()
3650 __ cmp(input, Operand(case_count)); in AssembleArchInstruction()
3653 __ BlockConstPoolFor(case_count + 2); in AssembleArchInstruction()
3656 for (size_t index = 0; index < case_count; ++index) { in AssembleArchInstruction()
H A Dinstruction-selector-arm.cc2123 size_t lookup_space_cost = 3 + 2 * sw.case_count(); in VisitSwitch()
2124 size_t lookup_time_cost = sw.case_count(); in VisitSwitch()
2125 if (sw.case_count() > 0 && in VisitSwitch()
/third_party/node/deps/v8/src/compiler/backend/x64/
H A Dcode-generator-x64.cc4577 int32_t const case_count = static_cast<int32_t>(instr->InputCount() - 2); in AssembleArchTableSwitch() local
4578 Label** cases = zone()->NewArray<Label*>(case_count); in AssembleArchTableSwitch()
4579 for (int32_t index = 0; index < case_count; ++index) { in AssembleArchTableSwitch()
4582 Label* const table = AddJumpTable(cases, case_count); in AssembleArchTableSwitch()
4583 __ cmpl(input, Immediate(case_count)); in AssembleArchTableSwitch()

Completed in 83 milliseconds

12