/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | md4-internal.c | 178 /* The three core functions - F1 is optimized somewhat */ 180 /* #define F1(x, y, z) (x & y | ~x & z) */ 181 #define F1(x, y, z) (z ^ (x & (y ^ z))) macro 216 MD4STEP(F1, a, b, c, d, in[ 0], 3); 217 MD4STEP(F1, d, a, b, c, in[ 1], 7); 218 MD4STEP(F1, c, d, a, b, in[ 2], 11); 219 MD4STEP(F1, b, c, d, a, in[ 3], 19); 220 MD4STEP(F1, a, b, c, d, in[ 4], 3); 221 MD4STEP(F1, d, a, b, c, in[ 5], 7); 222 MD4STEP(F1, [all...] |
H A D | md5-internal.c | 188 /* The four core functions - F1 is optimized somewhat */ 190 /* #define F1(x, y, z) (x & y | ~x & z) */ 191 #define F1(x, y, z) (z ^ (x & (y ^ z))) macro 192 #define F2(x, y, z) F1(z, x, y) 214 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 215 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 216 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 217 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 218 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 219 MD5STEP(F1, [all...] |
/external/wpa_supplicant_8/src/crypto/ |
H A D | md4-internal.c | 178 /* The three core functions - F1 is optimized somewhat */ 180 /* #define F1(x, y, z) (x & y | ~x & z) */ 181 #define F1(x, y, z) (z ^ (x & (y ^ z))) macro 216 MD4STEP(F1, a, b, c, d, in[ 0], 3); 217 MD4STEP(F1, d, a, b, c, in[ 1], 7); 218 MD4STEP(F1, c, d, a, b, in[ 2], 11); 219 MD4STEP(F1, b, c, d, a, in[ 3], 19); 220 MD4STEP(F1, a, b, c, d, in[ 4], 3); 221 MD4STEP(F1, d, a, b, c, in[ 5], 7); 222 MD4STEP(F1, [all...] |
H A D | md5-internal.c | 188 /* The four core functions - F1 is optimized somewhat */ 190 /* #define F1(x, y, z) (x & y | ~x & z) */ 191 #define F1(x, y, z) (z ^ (x & (y ^ z))) macro 192 #define F2(x, y, z) F1(z, x, y) 214 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 215 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 216 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 217 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 218 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 219 MD5STEP(F1, [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/crypto/ |
H A D | md4-internal.c | 178 /* The three core functions - F1 is optimized somewhat */ 180 /* #define F1(x, y, z) (x & y | ~x & z) */ 181 #define F1(x, y, z) (z ^ (x & (y ^ z))) macro 216 MD4STEP(F1, a, b, c, d, in[ 0], 3); 217 MD4STEP(F1, d, a, b, c, in[ 1], 7); 218 MD4STEP(F1, c, d, a, b, in[ 2], 11); 219 MD4STEP(F1, b, c, d, a, in[ 3], 19); 220 MD4STEP(F1, a, b, c, d, in[ 4], 3); 221 MD4STEP(F1, d, a, b, c, in[ 5], 7); 222 MD4STEP(F1, [all...] |
H A D | md5-internal.c | 188 /* The four core functions - F1 is optimized somewhat */ 190 /* #define F1(x, y, z) (x & y | ~x & z) */ 191 #define F1(x, y, z) (z ^ (x & (y ^ z))) macro 192 #define F2(x, y, z) F1(z, x, y) 214 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 215 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 216 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 217 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 218 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 219 MD5STEP(F1, [all...] |
/external/valgrind/main/drd/tests/ |
H A D | tsan_thread_wrappers_pthread.h | 436 typedef void (*F1)(void *arg1); typedef in struct:Closure 447 (F1(f))(param1);
|
H A D | tsan_unittest.cpp | 5051 void F1() { function in namespace:test105 5065 F1();
|
/external/skia/samplecode/ |
H A D | SampleBitmapRect.cpp | 243 static SkView* F1() { return new BitmapRectView2; } function 245 static SkViewRegister gR1(F1);
|
H A D | SampleRotateCircles.cpp | 357 static SkView* F1() { return new TestCirclesView; } function 358 static SkViewRegister gR1(F1);
|
/external/skia/src/core/ |
H A D | SkDistanceFieldGen.cpp | 196 static void F1(DFData* curr, int width) { function 374 F1(currData, dataWidth);
|
/external/skia/src/utils/ |
H A D | SkSHA1.cpp | 89 struct F1 { uint32_t operator()(uint32_t B, uint32_t C, uint32_t D) { struct 151 operation(F1(), A, B, C, D, E, W[ 0], K[0]); 152 operation(F1(), E, A, B, C, D, W[ 1], K[0]); 153 operation(F1(), D, E, A, B, C, W[ 2], K[0]); 154 operation(F1(), C, D, E, A, B, W[ 3], K[0]); 155 operation(F1(), B, C, D, E, A, W[ 4], K[0]); 156 operation(F1(), A, B, C, D, E, W[ 5], K[0]); 157 operation(F1(), E, A, B, C, D, W[ 6], K[0]); 158 operation(F1(), D, E, A, B, C, W[ 7], K[0]); 159 operation(F1(), [all...] |
/external/skia/gm/ |
H A D | dashing.cpp | 400 static skiagm::GM* F1(void*) { return new Dashing2GM; } function 405 static skiagm::GMRegistry gR1(F1);
|
H A D | pathfill.cpp | 229 static skiagm::GM* F1(void*) { return new PathInverseFillGM; } function 230 static skiagm::GMRegistry gR1(F1);
|
H A D | selftest.cpp | 54 static skiagm::GM* F1(void*) { function 61 static skiagm::GMRegistry gR1(F1);
|
H A D | strokes.cpp | 257 static skiagm::GM* F1(void*) { return new Strokes2GM; } function 261 static skiagm::GMRegistry R1(F1);
|
/external/pdfium/core/src/fdrm/crypto/ |
H A D | fx_crypt_sha.cpp | 225 #define F1(x,y,z) (z ^ (x & (y ^ z)))
macro 233 temp1 = h + S3(e) + F1(e,f,g) + K + x; \
|
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
H A D | cmsmd5.c | 57 #define F1(x, y, z) (z ^ (x & (y ^ z))) macro 58 #define F2(x, y, z) F1(z, x, y) 77 STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 78 STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 79 STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 80 STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 81 STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 82 STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); 83 STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); 84 STEP(F1, [all...] |
/external/pixman/test/ |
H A D | rotate-test.c | 31 #define F1 pixman_fixed_1 macro 39 TRANSFORM (0, -F1, F1, 0), /* correct 90 degree rotation */ 40 TRANSFORM (0, F1, -F1, 0), /* correct 270 degree rotation */ 41 TRANSFORM (F1, 0, 0, F1), /* correct identity */ 42 TRANSFORM (-F1, 0, 0, -F1), /* correct 180 degree rotation */
|
/external/openfst/src/include/fst/ |
H A D | lookahead-filter.h | 126 typedef typename M1::FST F1; typedef in class:fst::LookAheadSelector 141 const F1 &GetFst() const { return *fst_; } 146 const F1 *fst_;
|
/external/llvm/unittests/Support/ |
H A D | Casting.cpp | 111 foo &F1 = cast<foo>(B1); local 112 EXPECT_NE(&F1, null_foo); 142 const foo *F1 = dyn_cast<foo>(B2); local 143 EXPECT_NE(F1, null_foo); 156 const foo *F1 = dyn_cast_or_null<foo>(B2); local 157 EXPECT_NE(F1, null_foo);
|
H A D | Path.cpp | 288 fs::UniqueID F1, F2; local 289 ASSERT_NO_ERROR(fs::getUniqueID(Twine(TempPath), F1)); 291 ASSERT_EQ(F1, F2); 301 ASSERT_NE(D, F1); 311 ASSERT_EQ(D2, F1); 318 ASSERT_NO_ERROR(fs::getUniqueID(Dir1.c_str(), F1)); 320 ASSERT_EQ(F1, F2); 326 ASSERT_NE(F1, F2);
|
/external/llvm/unittests/Transforms/Utils/ |
H A D | Cloning.cpp | 160 Function *F1 = Function::Create(FT1, Function::ExternalLinkage); local 161 BasicBlock *BB = BasicBlock::Create(context, "", F1); 169 Argument *A = F1->arg_begin(); 176 CloneFunctionInto(F2, F1, VMap, false, Returns); 179 delete F1; 187 Function *F1 = Function::Create(FT1, Function::ExternalLinkage); local 188 F1->setCallingConv(CallingConv::Cold); 189 BasicBlock *BB = BasicBlock::Create(context, "", F1); 197 VMap[F1->arg_begin()] = F2->arg_begin(); 199 CloneFunctionInto(F2, F1, VMa [all...] |
/external/llvm/unittests/ExecutionEngine/JIT/ |
H A D | JITEventListenerTest.cpp | 90 Function *F1 = buildFunction(M); local 93 void *F1_addr = EE->getPointerToFunction(F1); 95 EE->getPointerToFunction(F1); // Should do nothing. 96 EE->freeMachineCodeForFunction(F1); 103 EXPECT_EQ(F1, Listener.EmittedEvents[0].F); 122 F1->eraseFromParent(); 131 Function *F1 = buildFunction(M); local 136 void *F1_addr = EE->getPointerToFunction(F1); 142 EE->freeMachineCodeForFunction(F1); 156 EXPECT_EQ(F1, Listener [all...] |
H A D | JITTest.cpp | 243 Function *F1 = makeReturnGlobal("F1", G, M); local 248 reinterpret_cast<void(*)()>((intptr_t)JIT->getPointerToFunction(F1)); 250 // Since F1 was codegen'd, a pointer to G should be available. 255 // F1() should increment G. 269 // Deallocate F1. 270 JIT->freeMachineCodeForFunction(F1);
|