Home
last modified time | relevance | path

Searched refs:cases (Results 426 - 450 of 516) sorted by relevance

1...<<1112131415161718192021

/third_party/icu/icu4c/source/test/intltest/
H A Ddtptngts.cpp28 // This is an API test, not a unit test. It doesn't test very many cases, and doesn't
491 // ======= Test simple use cases in testAPI()
492 logln("Testing simple use cases"); in testAPI()
1421 } cases[] = { in test20640_HourCyclArsEnNH() local
1434 for (auto& cas : cases) { in test20640_HourCyclArsEnNH()
H A Dtmsgfmt.cpp2009 } cases[] = { in TestMessageFormatNumberSkeleton() local
2022 for (auto& cas : cases) { in TestMessageFormatNumberSkeleton()
H A Dmeasfmttest.cpp4705 } cases[] = { in Test20332_PersonUnits() local
4719 for (const auto& cas : cases) { in Test20332_PersonUnits()
4807 } cases[] = { in TestIdentifiers() local
4880 for (const auto &cas : cases) { in TestIdentifiers()
4967 } cases[] = {
4999 for (auto cas : cases) {
5044 } cases[] = {
5056 for (auto &cas : cases) {
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/format/
H A DTestMessageFormat.java2100 Object[][] cases = new Object[][] { in TestMessageFormatNumberSkeleton()
2113 for (Object[] cas : cases) { in TestMessageFormatNumberSkeleton()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/format/
H A DTestMessageFormat.java2103 Object[][] cases = new Object[][] { in TestMessageFormatNumberSkeleton()
2116 for (Object[] cas : cases) { in TestMessageFormatNumberSkeleton()
/third_party/node/deps/v8/src/ast/
H A Dprettyprinter.cc147 for (CaseClause* clause : *node->cases()) { in VisitSwitchStatement()
967 for (CaseClause* clause : *node->cases()) { in VisitSwitchStatement()
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/memory_model/
H A DvktMemoryModelMessagePassing.cpp1785 static const std::string cases[] = in createPermutedIndexTests() local
1792 for (const auto& test : cases) in createPermutedIndexTests()
2031 // Limit RMW atomics to ST_ATOMIC_ATOMIC, just to reduce # of test cases in createTests()
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/spirv_assembly/
H A DvktSpvAsmVariablePointersTests.cpp582 // Therefore the Workgroup tests apply to cases where the VariablePointers capability is used (when 2 input buffers are used).
1405 static const Case cases[] =
1411 for (const auto& testCase : cases)
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/memory_model/
H A DvktMemoryModelMessagePassing.cpp1785 static const std::string cases[] = in createPermutedIndexTests() local
1792 for (const auto& test : cases) in createPermutedIndexTests()
2006 // Limit RMW atomics to ST_ATOMIC_ATOMIC, just to reduce # of test cases in createTests()
/third_party/python/Lib/test/
H A Dtest_http_cookiejar.py75 # test http2time for supported dates. Test cases with 2 digit year
762 cases = [
783 for arg, result in cases:
H A Dtest_grammar.py24 # Note: since several test cases filter out floats by looking for "e" and ".",
98 # Complex cases with parens:
839 # Check the heuristic for print & exec covers significant cases
844 cases = [
854 for case in cases:
1619 # Test cases should include: commas with 1 and 2 colons
1890 # Test ifelse expressions in various cases
H A Dtest_exceptions.py2392 cases = [
2471 for args, expected in cases:
/third_party/skia/third_party/externals/tint/src/resolver/
H A Dbuiltins_validation_test.cc50 static constexpr Params cases[] = { member
201 testing::ValuesIn(cases));
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DBasicTTIImpl.h352 for (auto CI : SI.cases()) { in getEstimatedNumberOfCaseClusters()
363 for (auto I : SI.cases()) in getEstimatedNumberOfCaseClusters()
798 // In other cases where the source or destination are illegal, assume in getCastInstrCost()
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/spirv_assembly/
H A DvktSpvAsmVariablePointersTests.cpp583 // Therefore the Workgroup tests apply to cases where the VariablePointers capability is used (when 2 input buffers are used).
1407 static const Case cases[] =
1412 for (const auto& testCase : cases)
/third_party/python/Python/
H A DPython-ast.c182 Py_CLEAR(state->cases); in _PyAST_Fini()
290 if ((state->cases = PyUnicode_InternFromString("cases")) == NULL) return 0; in init_identifiers()
479 "cases",
1147 " | Match(expr subject, match_case* cases)\n" in init_types()
1253 "Match(expr subject, match_case* cases)"); in init_types()
2333 _PyAST_Match(expr_ty subject, asdl_match_case_seq * cases, int lineno, int in _PyAST_Match() argument
2347 p->v.Match.cases = cases; in _PyAST_Match()
4048 value = ast2obj_list(state, (asdl_seq*)o->v.Match.cases, in ast2obj_stmt()
7347 asdl_match_case_seq* cases; obj2ast_stmt() local
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/shaderexecutor/
H A DvktShaderBuiltinPrecisionTests.cpp4452 + nanIfGreaterOrEqual(edge0, edge1); // force NaN (and non-analyzable result) for cases edge0 >= edge1 in doExpand()
4466 + nanIfGreaterOrEqual(edge0, edge1); // force NaN (and non-analyzable result) for cases edge0 >= edge1 in doExpand()
4479 + nanIfGreaterOrEqual(edge0, edge1); // force NaN (and non-analyzable result) for cases edge0 >= edge1 in doExpand()
7333 MovePtr<const CaseFactories> cases = (test16Bit && !storage32Bit) ? createBuiltinCases16Bit()
7335 for (size_t ndx = 0; ndx < cases->getFactories().size(); ++ndx)
7338 dstGroup.addChild(createFuncGroup(ctx, *cases->getFactories()[ndx], numRandoms));
7340 dstGroup.addChild(createFuncGroup16Bit(ctx, *cases->getFactories()[ndx], numRandoms, storage32Bit));
7350 MovePtr<const CaseFactories> cases = createBuiltinDoubleCases();
7351 for (size_t ndx = 0; ndx < cases->getFactories().size(); ++ndx)
7353 dstGroup.addChild(createFuncGroupDouble(ctx, *cases
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/shaderexecutor/
H A DvktShaderBuiltinPrecisionTests.cpp4441 + nanIfGreaterOrEqual(edge0, edge1); // force NaN (and non-analyzable result) for cases edge0 >= edge1 in doExpand()
4455 + nanIfGreaterOrEqual(edge0, edge1); // force NaN (and non-analyzable result) for cases edge0 >= edge1 in doExpand()
4468 + nanIfGreaterOrEqual(edge0, edge1); // force NaN (and non-analyzable result) for cases edge0 >= edge1 in doExpand()
7344 MovePtr<const CaseFactories> cases = (test16Bit && !storage32Bit) ? createBuiltinCases16Bit()
7346 for (size_t ndx = 0; ndx < cases->getFactories().size(); ++ndx)
7349 dstGroup.addChild(createFuncGroup(ctx, *cases->getFactories()[ndx], numRandoms));
7351 dstGroup.addChild(createFuncGroup16Bit(ctx, *cases->getFactories()[ndx], numRandoms, storage32Bit));
7361 MovePtr<const CaseFactories> cases = createBuiltinDoubleCases();
7362 for (size_t ndx = 0; ndx < cases->getFactories().size(); ++ndx)
7364 dstGroup.addChild(createFuncGroupDouble(ctx, *cases
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/InstCombine/
H A DInstructionCombining.cpp532 /// it just returns the 'Op' inputs. But for special-cases like
1263 // There are three cases for multiplication: multiplication by exactly in Descale()
1898 // avoids us creating a TON of code in some cases. in visitGetElementPtrInst()
2648 for (auto Case : SI.cases()) { in visitSwitchInst()
2664 for (auto &C : SI.cases()) { in visitSwitchInst()
2684 for (auto Case : SI.cases()) { in visitSwitchInst()
3526 // some N^2 behavior in pathological cases. in AddReachableCodeToWorklist()
3551 // the instcombine code from having to deal with some bad special cases. in prepareICWorklistFromFunction()
/third_party/ffmpeg/libavcodec/x86/
H A Dvp9itxfm.asm792 ; unfortunately, the code below overflows in some cases
1719 ; unfortunately, the code below overflows in some cases, e.g.
1744 ; unfortunately, the code below overflows in some cases
1799 ; unfortunately, the code below overflows in some cases, e.g.
/third_party/node/deps/v8/src/interpreter/
H A Dbytecode-generator.cc184 // where the remaining cases start at 0.
701 // Used when code special cases for TestResultScope and consumes any
1833 // Is the range of Smi's small enough relative to number of cases?
1880 ZonePtrList<CaseClause>* cases = stmt->cases(); in IsSwitchOptimizable() local
1882 for (int i = 0; i < cases->length(); ++i) { in IsSwitchOptimizable()
1883 CaseClause* clause = cases->at(i); in IsSwitchOptimizable()
1887 // Don't consider Smi cases after a non-literal, because we in IsSwitchOptimizable()
1896 // GCC also jump-table optimizes switch statements with 6 cases or more. in IsSwitchOptimizable()
1911 IsSpreadAcceptable(static_cast<int>(spread), cases in IsSwitchOptimizable()
[all...]
/third_party/vk-gl-cts/modules/gles31/functional/
H A Des31fPrimitiveBoundingBoxTests.cpp316 std::vector<BoundingBox> cases;
318 cases.insert(cases.begin(), DE_ARRAY_BEGIN(fixedCases), DE_ARRAY_END(fixedCases));
327 cases.push_back(boundingBox);
335 for (int caseNdx = 0; caseNdx < (int)cases.size(); ++caseNdx)
338 const BoundingBox& boundingBox = cases[caseNdx];
/third_party/skia/src/sksl/codegen/
H A DSkSLMetalCodeGenerator.cpp223 // We need to detect cases where the caller passes the same variable as an out-param more than in getOutParamHelper()
224 // once, and avoid reusing the variable name. (In those cases we can actually just ignore the in getOutParamHelper()
1081 // scalars.) Some cases are simple to translate and so we handle those inline--e.g. a list of in matrixConstructHelperIsNeeded()
1082 // scalars can be constructed trivially. In more complex cases, we generate a helper function in matrixConstructHelperIsNeeded()
2206 for (const std::unique_ptr<Statement>& stmt : s.cases()) { in writeSwitchStatement()
2675 for (const std::unique_ptr<Statement>& sc : sw.cases()) { in requirements()
/third_party/skia/third_party/externals/opengl-registry/xml/
H A Dreadme.tex784 the \tag{ptype} tags of commands, but in a few cases, additional
851 parameters which {\bf could} be given a group, and in many cases, the
/third_party/rust/crates/syn/src/gen/
H A Dclone.rs1494 cases: self.cases.clone(), in clone()

Completed in 102 milliseconds

1...<<1112131415161718192021