/external/opencv/cvaux/src/ |
D | cvvideo.cpp | 53 CvMat odd_stub, *odd = (CvMat*)fieldOdd; in cvDeInterlace() local 59 CV_CALL( odd = cvGetMat( odd, &odd_stub )); in cvDeInterlace() 61 if( !CV_ARE_TYPES_EQ( frame, even ) || !CV_ARE_TYPES_EQ( frame, odd )) in cvDeInterlace() 64 if( frame->cols != even->cols || frame->cols != odd->cols || in cvDeInterlace() 65 frame->rows != even->rows*2 || odd->rows != even->rows ) in cvDeInterlace() 75 memcpy( odd->data.ptr + even->step*y, in cvDeInterlace()
|
/external/eigen/Eigen/src/Geometry/ |
D | EulerAngles.h | 48 const Index odd = ((a0+1)%3 == a1) ? 0 : 1; in eulerAngles() local 50 const Index j = (a0 + 1 + odd)%3; in eulerAngles() 51 const Index k = (a0 + 2 - odd)%3; in eulerAngles() 56 if((odd && res[0]<Scalar(0)) || ((!odd) && res[0]>Scalar(0))) in eulerAngles() 86 if((odd && res[0]<Scalar(0)) || ((!odd) && res[0]>Scalar(0))) { in eulerAngles() 96 if (!odd) in eulerAngles()
|
/external/stlport/test/unit/ |
D | bcompos_test.cpp | 38 binary_compose<logical_and<bool>, odd, positive> in bcompos1() 39 b = binary_compose<logical_and<bool>, odd, positive>(logical_and<bool>(), odd(), positive()); in bcompos1() 52 compose2(logical_and<bool>(), odd(), positive())); in bcompos2()
|
D | count_test.cpp | 24 static int odd(int a_); 62 int elements = count_if(numbers.begin(), numbers.end(), odd); in countif1() 66 count_if(numbers.begin(), numbers.end(), odd, elements); in countif1() 70 int CountTest::odd(int a_) in odd() function in CountTest
|
D | find_test.cpp | 29 static bool odd(int a_); 78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd); in findif0() 84 int *out_range = find_if((int*)numbers_even, (int*)numbers_even + 6, odd); in findif0() 107 bool FindTest::odd(int a_) in odd() function in FindTest
|
D | rm_cp_test.cpp | 46 static bool odd(int a_) in odd() function 88 replace_if(v1.begin(), v1.end(), odd, 42); in replif1() 163 replace_copy_if(v1.begin(), v1.end(), v2.begin(), odd, 42); in repcpif1() 205 remove_if((int*)numbers, (int*)numbers + 6, odd); in remif1() 236 remove_copy_if((int*)numbers, (int*)numbers + 6, (int*)result, odd); in remcpif1()
|
D | unary_test.cpp | 48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd())); in unegate1() 55 int* p = find_if((int*)array, (int*)array + 3, not1(odd())); in unegate2()
|
/external/clang/test/Analysis/ |
D | NewDelete-path-notes.cpp | 23 void test(Odd *odd) { in test() argument 24 odd->kill(); // expected-note{{Calling 'Odd::kill'}} in test() 26 delete odd; // expected-warning {{Attempt to free released memory}} in test()
|
/external/llvm/test/MC/Mips/ |
D | nooddspreg-error.s | 9 # CHECK-ERROR: :[[@LINE-1]]:15: error: -mno-odd-spreg prohibits the use of odd FPU registers 10 # CHECK-ERROR: :[[@LINE-2]]:25: error: -mno-odd-spreg prohibits the use of odd FPU registers
|
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
D | fx_zlib_crc32.c | 363 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ in crc32_combine_() local 370 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */ in crc32_combine_() 373 odd[n] = row; in crc32_combine_() 378 gf2_matrix_square(even, odd); in crc32_combine_() 381 gf2_matrix_square(odd, even); in crc32_combine_() 387 gf2_matrix_square(even, odd); in crc32_combine_() 397 gf2_matrix_square(odd, even); in crc32_combine_() 399 crc1 = gf2_matrix_times(odd, crc1); in crc32_combine_()
|
/external/chromium_org/third_party/zlib/ |
D | crc32.c | 380 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local 387 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */ 390 odd[n] = row; 395 gf2_matrix_square(even, odd); 398 gf2_matrix_square(odd, even); 404 gf2_matrix_square(even, odd); 414 gf2_matrix_square(odd, even); 416 crc1 = gf2_matrix_times(odd, crc1);
|
/external/qemu/distrib/zlib-1.2.8/ |
D | crc32.c | 363 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local 370 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */ 373 odd[n] = row; 378 gf2_matrix_square(even, odd); 381 gf2_matrix_square(odd, even); 387 gf2_matrix_square(even, odd); 397 gf2_matrix_square(odd, even); 399 crc1 = gf2_matrix_times(odd, crc1);
|
/external/zlib/src/ |
D | crc32.c | 363 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local 370 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */ 373 odd[n] = row; 378 gf2_matrix_square(even, odd); 381 gf2_matrix_square(odd, even); 387 gf2_matrix_square(even, odd); 397 gf2_matrix_square(odd, even); 399 crc1 = gf2_matrix_times(odd, crc1);
|
/external/chromium_org/chrome/browser/resources/signin_internals/ |
D | signin_index.css | 42 tr:nth-child(odd) { 46 table.signin-details tr:nth-child(odd).ok { 74 tr[highlighted]:nth-child(odd) {
|
/external/chromium_org/components/autofill/core/browser/ |
D | validation.cc | 88 bool odd = false; in IsValidCreditCardNumber() local 96 if (odd) { in IsValidCreditCardNumber() 102 odd = !odd; in IsValidCreditCardNumber()
|
/external/icu/icu4c/source/test/intltest/ |
D | testidna.cpp | 996 UChar odd[MAX_DEST_SIZE]; in testChaining() local 1009 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR); in testChaining() 1013 evenLen = func(odd,-1,even,MAX_DEST_SIZE,options, &parseError, &status); in testChaining() 1019 oddLen = func(even,-1,odd,MAX_DEST_SIZE,options, &parseError, &status); in testChaining() 1028 u_strCaseCompare(odd,oddLen, expected,expectedLen, 0, &status) !=0 ){ in testChaining() 1034 u_strncmp(odd,expected,expectedLen) !=0 ){ in testChaining() 1046 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR); in testChaining() 1050 … evenLen = func(odd,-1,even,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status); in testChaining() 1056 … oddLen = func(even,-1,odd,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status); in testChaining() 1065 u_strCaseCompare(odd,oddLen, expected,expectedLen, 0, &status) !=0 ){ in testChaining() [all …]
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
D | testidna.cpp | 996 UChar odd[MAX_DEST_SIZE]; in testChaining() local 1009 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR); in testChaining() 1013 evenLen = func(odd,-1,even,MAX_DEST_SIZE,options, &parseError, &status); in testChaining() 1019 oddLen = func(even,-1,odd,MAX_DEST_SIZE,options, &parseError, &status); in testChaining() 1028 u_strCaseCompare(odd,oddLen, expected,expectedLen, 0, &status) !=0 ){ in testChaining() 1034 u_strncmp(odd,expected,expectedLen) !=0 ){ in testChaining() 1046 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR); in testChaining() 1050 … evenLen = func(odd,-1,even,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status); in testChaining() 1056 … oddLen = func(even,-1,odd,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status); in testChaining() 1065 u_strCaseCompare(odd,oddLen, expected,expectedLen, 0, &status) !=0 ){ in testChaining() [all …]
|
/external/linux-tools-perf/perf-3.12.0/arch/h8300/lib/ |
D | memcpy.S | 29 ;; (aligned even) odd address 67 ;; odd <- even / even <- odd
|
/external/emma/core/java12/com/vladium/emma/report/html/ |
D | ReportGenerator.java | 282 boolean odd = true; in visit() 284 for (Iterator packages = item.getChildren (order); packages.hasNext (); odd = ! odd) in visit() 300 addItemRow (pkg, odd, childSummaryTable, headerColumns, childHREF, false); in visit() 399 boolean odd = true; in visit() 401 … for (Iterator srcORclsFiles = item.getChildren (order); srcORclsFiles.hasNext (); odd = ! odd) in visit() 417 addItemRow (srcORcls, odd, childSummaryTable, headerColumns, childHREF, false); in visit() 559 boolean odd = false; in visit() 561 … for (Iterator methods = cls.getChildren (order2); methods.hasNext (); odd = ! odd) in visit() 580 … addClassItemRow (method, odd, childSummaryTable, headerColumns, HREFname, createAnchors); in visit() 691 boolean odd = true; in visit() [all …]
|
/external/chromium_org/third_party/cython/src/Cython/Tempita/ |
D | _looper.py | 107 def odd(self): member in loop_pos 109 odd = property(odd) variable in loop_pos
|
/external/llvm/test/CodeGen/AArch64/ |
D | arm64-neon-compare-instructions.ll | 158 ; Using registers other than v0, v1 are possible, but would be odd. 167 ; Using registers other than v0, v1 are possible, but would be odd. 176 ; Using registers other than v0, v1 are possible, but would be odd. 185 ; Using registers other than v0, v1 are possible, but would be odd. 194 ; Using registers other than v0, v1 are possible, but would be odd. 203 ; Using registers other than v0, v1 are possible, but would be odd. 212 ; Using registers other than v0, v1 are possible, but would be odd. 270 ; Using registers other than v0, v1 are possible, but would be odd. 279 ; Using registers other than v0, v1 are possible, but would be odd. 288 ; Using registers other than v0, v1 are possible, but would be odd. [all …]
|
D | neon-compare-instructions.ll | 180 ; Using registers other than v0, v1 are possible, but would be odd. 190 ; Using registers other than v0, v1 are possible, but would be odd. 200 ; Using registers other than v0, v1 are possible, but would be odd. 210 ; Using registers other than v0, v1 are possible, but would be odd. 220 ; Using registers other than v0, v1 are possible, but would be odd. 230 ; Using registers other than v0, v1 are possible, but would be odd. 240 ; Using registers other than v0, v1 are possible, but would be odd. 306 ; Using registers other than v0, v1 are possible, but would be odd. 316 ; Using registers other than v0, v1 are possible, but would be odd. 326 ; Using registers other than v0, v1 are possible, but would be odd. [all …]
|
D | arm64-extract.ll | 27 ; Order of lhs and rhs matters here. Regalloc would have to be very odd to use 39 ; Order of lhs and rhs matters here. Regalloc would have to be very odd to use
|
D | extract.ll | 26 ; Order of lhs and rhs matters here. Regalloc would have to be very odd to use 38 ; Order of lhs and rhs matters here. Regalloc would have to be very odd to use
|
/external/llvm/test/CodeGen/Mips/ |
D | no-odd-spreg.ll | 13 ; The intention is that if odd single precision registers are permitted, the 16 ; On the other hand, if odd single precision registers are not permitted, it 40 ; -mno-odd-sp-reg doesn't need to affect double precision values so both cases
|