/external/llvm/unittests/ADT/ |
BitmaskEnumTest.cpp | 18 F1 = 1, 26 Flags f = F1 | F2; 34 Flags f = F1; 40 (f |= F3) = F1; 41 EXPECT_EQ(F1, f); 48 f = (f | F3) & (F1 | F2 | F3); 53 Flags f = F1 | F2 | F3; 54 f &= F1 | F2; 58 (f &= F1) = F3; 63 Flags f = (F1 | F2) ^ (F2 | F3) [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
BitmaskEnumTest.cpp | 18 F1 = 1, 26 Flags f = F1 | F2; 34 Flags f = F1; 40 (f |= F3) = F1; 41 EXPECT_EQ(F1, f); 48 f = (f | F3) & (F1 | F2 | F3); 53 Flags f = F1 | F2 | F3; 54 f &= F1 | F2; 58 (f &= F1) = F3; 63 Flags f = (F1 | F2) ^ (F2 | F3) [all...] |
/external/llvm/unittests/IR/ |
FunctionTest.cpp | 43 std::unique_ptr<Function> F1( 44 Function::Create(FTy, GlobalValue::ExternalLinkage, "F1")); 46 Function::Create(FTy, GlobalValue::ExternalLinkage, "F1")); 47 EXPECT_TRUE(F1->hasLazyArguments()); 54 F1->stealArgumentListFrom(*F2); 55 EXPECT_TRUE(F1->hasLazyArguments()); 58 // Save arguments from F1 for later assertions. F1 won't have lazy arguments 61 for (Argument &A : F1->args()) 64 EXPECT_FALSE(F1->hasLazyArguments()) [all...] |
/art/test/805-TooDeepClassInstanceOf/src/ |
Main.java | 26 class F1 extends E1 {} 28 class G1 extends F1 {} 41 A f1 = new F1(); local 48 expectFalse(b1 instanceof F1); 49 expectTrue(f1 instanceof B1); 53 expectFalse(b2 instanceof F1); 54 expectFalse(f1 instanceof B2); 58 expectFalse(f2 instanceof F1); 59 expectFalse(f1 instanceof F2) [all...] |
/external/clang/test/CodeGen/ |
2002-05-23-TypeNameCollision.c | 10 foo F1;
|
/external/clang/test/Modules/ |
macro-reexport.cpp | 20 #if defined(F1) 21 #include "f1.h"
|
/external/compiler-rt/test/asan/TestCases/Posix/ |
coverage-direct-large.cc | 26 #define F1(Q, x) \ 30 F1(Q, x##0) F1(Q, x##1) F1(Q, x##2) F1(Q, x##3) F1(Q, x##4) F1(Q, x##5) \ 31 F1(Q, x##6) F1(Q, x##7) F1(Q, x##8) F1(Q, x##9 [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/ |
FunctionTest.cpp | 44 std::unique_ptr<Function> F1( 45 Function::Create(FTy, GlobalValue::ExternalLinkage, "F1")); 47 Function::Create(FTy, GlobalValue::ExternalLinkage, "F1")); 48 EXPECT_TRUE(F1->hasLazyArguments()); 55 F1->stealArgumentListFrom(*F2); 56 EXPECT_TRUE(F1->hasLazyArguments()); 59 // Save arguments from F1 for later assertions. F1 won't have lazy arguments 62 for (Argument &A : F1->args()) 65 EXPECT_FALSE(F1->hasLazyArguments()) [all...] |
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
p5-generic-lambda-1y.cpp | 14 template <class F1, class F2> struct overload : F1, F2 { 15 using F1::operator(); 17 overload(F1 f1, F2 f2) : F1(f1), F2(f2) { } 32 template <class F1, class F2> struct overload : F1, F2 { 33 using F1::operator() [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Transforms/Utils/ |
FunctionComparator.cpp | 48 TestComparator(const Function *F1, const Function *F2, 50 : FunctionComparator(F1, F2, GN) { 53 bool testFunctionAccess(const Function *F1, const Function *F2) { 55 return F1 == FnL && F2 == FnR; 112 TestFunction F1(C, M, 27); 116 TestComparator Cmp(F1.F, F2.F, &GN); 118 EXPECT_TRUE(Cmp.testFunctionAccess(F1.F, F2.F)); 121 EXPECT_EQ(Cmp.testCmpBasicBlocks(F1.BB, F2.BB), -1); 122 EXPECT_EQ(Cmp.testCmpConstants(F1.C, F2.C), -1); 123 EXPECT_EQ(Cmp.testCmpGlobalValues(F1.F, F2.F), -1) [all...] |
/device/linaro/bootloader/edk2/Vlv2TbltDevicePkg/Library/MultiPlatformLib/BoardGpios/ |
BoardGpios.h | 173 GPIO_INIT_ITEM("SATA_GP0 GPIOC_0 " ,Native ,NA ,F1 , , ,NONE ,0x55),
174 GPIO_INIT_ITEM("SATA_GP1 GPIOC_1 " ,Native ,NA ,F1 , , ,NONE ,0x59),
175 GPIO_INIT_ITEM("SATA_LEDN GPIOC_2 " ,Native ,NA ,F1 , , ,NONE ,0x5d),
176 GPIO_INIT_ITEM("PCIE_CLKREQ0B GPIOC_3 " ,Native ,NA ,F1 , , ,10K_H ,0x60),
177 GPIO_INIT_ITEM("PCIE_CLKREQ1B GPIOC_4 " ,Native ,NA ,F1 , , ,10K_H ,0x63),
178 GPIO_INIT_ITEM("PCIE_CLKREQ2B GPIOC_5 " ,Native ,NA ,F1 , , ,10K_H ,0x66),
209 GPIO_INIT_ITEM("SDMMC3_CLK GPIOC_33 " ,Native ,NA ,F1 , , ,NONE ,0x2b),
210 GPIO_INIT_ITEM("SDMMC3_D0 GPIOC_34 " ,Native ,NA ,F1 , , ,NONE ,0x2e),
211 GPIO_INIT_ITEM("SDMMC3_D1 GPIOC_35 " ,Native ,NA ,F1 ,YES , ,NONE ,0x29),
212 GPIO_INIT_ITEM("SDMMC3_D2 GPIOC_36 " ,Native ,NA ,F1 , , ,NONE ,0x2d), [all...] |
/external/mksh/src/ |
exprtok.h | 26 #define F1(enum) /* nothing */ 30 #define F1(enum) enum, 35 #define F1(enum) "" 38 #define F1(enum) 0 41 #define F1(enum) P_PRIMARY 109 F1(VAR) /*XXX should be F2 */ 116 #undef F1
|
/external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.def/namespace.memdef/ |
p3.cpp | 25 friend struct F1; 26 friend void f1(int); 27 struct F1 member_func(); 29 struct F1 { }; 30 F1 f1() { return S1::IS1().member_func(); } function in namespace:N 32 N::F1 f1_var = N::f1();
|
/external/clang/test/FixIt/ |
fixit-vexing-parse.cpp | 29 int F1(); 84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} 85 F1(); // expected-warning {{function declaration}} expected-note {{replace parentheses with an initializer}}
|
/external/libcxx/test/support/ |
verbose_assert.h | 160 AssertData CheckCollectionsEqual(It1 F1, It1 E1, It2 F2, It2 E2, 162 const It1 F1Orig = F1; 167 while (F1 != E1 && F2 != E2) { 168 if (!(C(*F1, *F2))) { 169 ErrorMsg += PrintMismatch(*F1, *F2, Idx); 174 ++F1; 177 if (!Failed && (F1 != E1 || F2 != E2)) { 209 #define ASSERT_COLLECTION_EQ_COMP(F1, E1, F2, E2, Comp) \ 212 F1, E1, F2, E2, \ 213 ::verbose_assert::AssertData("CheckCollectionsEqual(" #F1 ", " #E1 [all...] |
/external/swiftshader/third_party/LLVM/unittests/ExecutionEngine/JIT/ |
JITEventListenerTest.cpp | 92 Function *F1 = buildFunction(M); 95 void *F1_addr = EE->getPointerToFunction(F1); 97 EE->getPointerToFunction(F1); // Should do nothing. 98 EE->freeMachineCodeForFunction(F1); 105 EXPECT_EQ(F1, Listener.EmittedEvents[0].F); 124 F1->eraseFromParent(); 133 Function *F1 = buildFunction(M); 138 void *F1_addr = EE->getPointerToFunction(F1); 144 EE->freeMachineCodeForFunction(F1); 158 EXPECT_EQ(F1, Listener1.EmittedEvents[0].F) [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Support/ |
TaskQueueTest.cpp | 37 std::future<void> F1 = TQ.async([&] { 51 F1.wait(); 79 std::future<void> F1 = TQ.async([&] { ++X; }); 102 std::future<std::string> F1 = TQ.async([&] { return std::string("Hello"); }); 106 ASSERT_EQ("Hello", F1.get());
|
/cts/tests/tests/media/libmediandkjni/ |
md5_utils.cpp | 141 /* The four core functions - F1 is optimized somewhat */ 143 /* #define F1(x, y, z) (x & y | ~x & z) */ 144 #define F1(x, y, z) (z ^ (x & (y ^ z))) 145 #define F2(x, y, z) F1(z, x, y) 167 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 168 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 169 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 170 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 171 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 172 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |
/external/autotest/client/deps/glbench/src/ |
md5.cc | 144 /* The four core functions - F1 is optimized somewhat */ 146 /* #define F1(x, y, z) (x & y | ~x & z) */ 147 #define F1(x, y, z) (z ^ (x & (y ^ z))) 148 #define F2(x, y, z) F1(z, x, y) 169 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 170 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 171 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 172 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 173 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 174 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |
/external/dynamic_depth/internal/xmpmeta/ |
md5.cc | 113 // The four core functions - F1 is optimized somewhat. 114 // #define F1(x, y, z) (x & y | ~x & z) 115 #define F1(x, y, z) (z ^ (x & (y ^ z))) 116 #define F2(x, y, z) F1(z, x, y) 145 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 146 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 147 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 148 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 149 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 150 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |
/external/google-breakpad/src/common/ |
md5.cc | 150 /* The four core functions - F1 is optimized somewhat */ 152 /* #define F1(x, y, z) (x & y | ~x & z) */ 153 #define F1(x, y, z) (z ^ (x & (y ^ z))) 154 #define F2(x, y, z) F1(z, x, y) 176 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 177 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 178 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 179 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 180 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 181 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |
/external/libaom/libaom/common/ |
md5_utils.c | 136 /* The four core functions - F1 is optimized somewhat */ 138 /* #define F1(x, y, z) (x & y | ~x & z) */ 139 #define F1(x, y, z) (z ^ (x & (y ^ z))) 140 #define F2(x, y, z) F1(z, x, y) 173 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 174 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 175 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 176 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 177 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 178 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |
/external/libchrome/base/ |
md5.cc | 50 /* The four core functions - F1 is optimized somewhat */ 52 /* #define F1(x, y, z) (x & y | ~x & z) */ 53 #define F1(x, y, z) (z ^ (x & (y ^ z))) 54 #define F2(x, y, z) F1(z, x, y) 75 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 76 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 77 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 78 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 79 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 80 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |
/external/libjpeg-turbo/md5/ |
md5.c | 177 /* The four core functions - F1 is optimized somewhat */ 179 /* #define F1(x, y, z) (x & y | ~x & z) */ 180 #define F1(x, y, z) (z ^ (x & (y ^ z))) 181 #define F2(x, y, z) F1(z, x, y) 203 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 204 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 205 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 206 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 207 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 208 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |
/external/libvpx/libvpx/ |
md5_utils.c | 136 /* The four core functions - F1 is optimized somewhat */ 138 /* #define F1(x, y, z) (x & y | ~x & z) */ 139 #define F1(x, y, z) (z ^ (x & (y ^ z))) 140 #define F2(x, y, z) F1(z, x, y) 173 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 174 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 175 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 176 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 177 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 178 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12) [all...] |