| /third_party/skia/third_party/externals/spirv-cross/ |
| H A D | spirv_glsl.cpp | 1621 // This is a rather dirty workaround to deal with some cases of OpSpecConstantOp used as array size, e.g:
1626 // If we are the last member of a struct, there might be cases where the actual size of that member is irrelevant
4265 // If the expression starts with a unary we need to enclose to deal with cases where we have back-to-back
4328 // This doesn't work for cases like (*foo + 10),
4578 // Do not use empty expressions here, because those are sentinels for other cases.
5886 // Bit-widths might be different in unary cases because we use it for SConvert/UConvert and friends.
6364 // This helps for cases like int(bool), uint(bool) which is implemented with
8073 // Floating <-> Integer special casts. Just have to enumerate all cases. :(
8831 // Cleans up some cases where it's very painful to determine the accurate storage class
9770 // adding lots of special cases t
[all...] |
| /third_party/mbedtls/tests/ |
| H A D | ssl-opt.sh | 135 printf " --list-test-cases\tList all potential test cases (No Execution)\n"
163 -l|--list-test-cases)
535 # The test case forces a non-PSK cipher suite. In some cases, a
1853 # detects simple cases: plain substring, everything, nothing.
5976 # value, defined here as MAX_IM_CA. Some test cases will be skipped if the
10061 # Tests for various cases of client authentication with DTLS
10479 # retransmissions, but in some cases (like both the server and client using
12132 # TLS1.3 test cases
|
| /third_party/mesa3d/src/compiler/glsl/ |
| H A D | ast_to_hir.cpp | 399 * conversion, the following cases are valid in arithmetic_result_type()
457 * row vector. In all these cases, it is required that the number of in arithmetic_result_type()
480 /* "All other cases are illegal." in arithmetic_result_type()
778 /* "In all cases, the resulting type will be the same type as the left in shift_result_type()
1337 /* We need to go through the subexpressions tree to cover cases like in set_is_lhs()
2159 * there are some cases in C (especially with GCC extensions) where in do_hir()
2161 * effect, but I don't think these cases exist in GLSL. Either way, in do_hir()
4353 * storage qualifier. There are a couple special cases. in get_variable_being_redeclared()
4968 * In these cases the parser will set the 'invariant' flag in the declarator in hir()
5211 * use-cases in hir()
[all...] |
| /third_party/node/deps/v8/src/parsing/ |
| H A D | parser-base.h | 1373 // Same as the above, but handles those cases where <init> is a
4005 // Check for an identifier first, so that we can elide the pattern in cases in ParseVariableDeclarations()
5244 // labels can be simply ignored in all other cases; except for in ParseStatement()
5849 switch_statement->cases()->Add(clause, zone()); in ParseSwitchStatement()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | CodeGenPrepare.cpp | 995 // cases like this: in simplifyRelocatesOffABase()
1011 // no matter there is already one or not. In this way, we can handle all cases, and in simplifyRelocatesOffABase()
1201 // run-loop. The recomputing is probably unnecessary in many cases, so if in replaceMathCmpWithIntrinsic()
1543 // Try to avoid cases where sinking/duplicating is likely to increase register in sinkAndCmp0Expression()
1829 // Only handle legal scalar cases. Anything else requires too much work. in despeculateCountZeros()
4389 "TypePromotionHelper should have filtered out those cases"); in matchOperationAddr()
4549 // of users. This avoids excessive compilation times in pathological cases. in FindAllMemoryUses()
4799 // Phi nodes ends up with all cases to compute address of the form in optimizeMemoryInst()
4802 // are exactly the same Values in all cases. in optimizeMemoryInst()
5268 "TypePromotionHelper should have filtered out those cases"); in tryToPromoteExts()
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
| H A D | Verifier.cpp | 2502 for (auto &Case : SI.cases()) { in visitSwitchInst()
4521 // In all other cases relocate should be tied to the statepoint directly. in visitIntrinsicCall()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Bitcode/Writer/ |
| H A D | BitcodeWriter.cpp | 1833 // to distinguish the following cases: in writeDILocalVariable()
2742 for (auto Case : SI.cases()) { in writeInstruction()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| H A D | Attributor.cpp | 2178 // We return None in the first 2 cases to signify that an appropriate
3022 for (auto &CaseIt : SI.cases()) { in identifyAliveSuccessors()
3873 // itself knows about a lot of other non-capturing cases already.
|
| /kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/ |
| H A D | fplsp.S | 6713 # Step 1. Filter out extreme cases of input argument. #
6730 # number of cases where |X| is less than, but close to, #
|
| /kernel/linux/linux-6.6/arch/m68k/ifpsp060/src/ |
| H A D | fplsp.S | 6713 # Step 1. Filter out extreme cases of input argument. #
6730 # number of cases where |X| is less than, but close to, #
|
| /third_party/python/Parser/ |
| H A D | parser.c | 7366 asdl_match_case_seq* cases; in match_stmt_rule() local
7382 (cases = (asdl_match_case_seq*)_loop1_64_rule(p)) // case_block+ in match_stmt_rule()
7397 _res = CHECK_VERSION ( stmt_ty , 10 , "Pattern matching is" , _PyAST_Match ( subject , cases , EXTRA ) ); in match_stmt_rule()
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGBuilder.cpp | 485 // Handle cases such as i8 -> <1 x i1> in getCopyFromPartsVector()
2222 /// If the set of cases should be emitted as a series of branches, return true.
2273 // If this condition is one of the special cases we handle, do special stuff in visitBr()
2308 // Allow some cases to be rejected. in visitBr()
2364 // handle common cases produced by branch lowering. in visitSwitchCase()
4372 // In all other cases the function returns 'false'.
9234 // info is not there but there are cases it cannot get right. in LowerCallTo()
9272 // cases it's safe to pass the argument register value unchanged as the in LowerCallTo()
9737 // guess if this info is not there but there are cases it cannot get in LowerArguments()
10089 /// when they are tail calls. In such cases, th
[all...] |
| /third_party/libabigail/tests/lib/ |
| H A D | catch.hpp | 4227 // There are 2 basic cases:
9820 ( "list all/matching test cases" )
9874 ( "list all/matching test cases names only" )
11261 Catch::cout() << "Matching test cases:\n";
11263 Catch::cout() << "All available test cases:\n";
11333 Catch::cout() << "Tags for matching test cases:\n";
12643 // This catches cases where `GENERATE` is placed between two
15864 // - red: Failed [both/all] N test cases, failed [both/all] M assertions.
15865 // - white: Passed [both/all] N test cases (no assertions).
15866 // - red: Failed N tests cases, faile
[all...] |