/external/webrtc/webrtc/modules/desktop_capture/ |
D | differ.cc | 29 diff_info_width_ = ((width_ + kBlockSize - 1) / kBlockSize) + 1; in Differ() 30 diff_info_height_ = ((height_ + kBlockSize - 1) / kBlockSize) + 1; in Differ() 53 int x_full_blocks = width_ / kBlockSize; in MarkDirtyBlocks() 54 int y_full_blocks = height_ / kBlockSize; in MarkDirtyBlocks() 57 int partial_column_width = width_ - (x_full_blocks * kBlockSize); in MarkDirtyBlocks() 58 int partial_row_height = height_ - (y_full_blocks * kBlockSize); in MarkDirtyBlocks() 61 int block_x_offset = bytes_per_pixel_ * kBlockSize; in MarkDirtyBlocks() 63 int block_y_stride = (width_ * bytes_per_pixel_) * kBlockSize; in MarkDirtyBlocks() 89 partial_column_width, kBlockSize); in MarkDirtyBlocks() 109 kBlockSize, partial_row_height); in MarkDirtyBlocks() [all …]
|
D | differ_block_unittest.cc | 28 static const int kSizeOfBlock = kBlockSize * kBlockSize * kBytesPerPixel; 46 int result = BlockDifference(block1, block2, kBlockSize * kBytesPerPixel); in TEST() 58 int result = BlockDifference(block1, block2, kBlockSize * kBytesPerPixel); in TEST() 70 int result = BlockDifference(block1, block2, kBlockSize * kBytesPerPixel); in TEST() 82 int result = BlockDifference(block1, block2, kBlockSize * kBytesPerPixel); in TEST()
|
D | differ_unittest.cc | 77 * kBlockSize; in DiffBlock() 87 WritePixel(buffer, (block_x * kBlockSize) + pixel_x, in WriteBlockPixel() 88 (block_y * kBlockSize) + pixel_y, value); in WriteBlockPixel() 158 DesktopRect::MakeXYWH(x * kBlockSize, y * kBlockSize, in CheckDirtyRegionContainsRect() 159 width * kBlockSize, height * kBlockSize); in CheckDirtyRegionContainsRect() 180 x_origin * kBlockSize, y_origin * kBlockSize, in MarkBlocksAndCheckMerge() 181 width * kBlockSize, height * kBlockSize); in MarkBlocksAndCheckMerge() 281 int max = kBlockSize - 1; in TEST_F()
|
D | differ_block.cc | 24 int width_bytes = kBlockSize * kBytesPerPixel; in BlockDifference_C() 26 for (int y = 0; y < kBlockSize; y++) { in BlockDifference_C() 48 if (have_sse2 && kBlockSize == 32) { in BlockDifference() 50 } else if (have_sse2 && kBlockSize == 16) { in BlockDifference()
|
/external/skqp/gm/ |
D | drawatlascolor.cpp | 20 const int kBlockSize = atlasSize/2; in make_atlas() local 31 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas() 35 r = SkRect::MakeXYWH(SkIntToScalar(kBlockSize), 0, in make_atlas() 36 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas() 40 r = SkRect::MakeXYWH(0, SkIntToScalar(kBlockSize), in make_atlas() 41 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas() 45 r = SkRect::MakeXYWH(SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize), in make_atlas() 46 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas()
|
D | bleed.cpp | 227 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase1() 243 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase2() 262 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase3() 278 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase4() 296 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase5() 325 constexpr SkScalar kBottom = SkIntToScalar(kRow4Y + kBlockSize + kBlockSpacing); in onDraw() 394 SkScalar x = kBlockSize + SkTMax(SkTMax(corners[0].fX, corners[1].fX), in onDraw() 408 static constexpr int kBlockSize = 70; member in BleedGM 412 static constexpr int kCol1X = 2*kBlockSpacing + kBlockSize; 413 static constexpr int kCol2X = 3*kBlockSpacing + 2*kBlockSize; [all …]
|
/external/skia/gm/ |
D | drawatlascolor.cpp | 20 const int kBlockSize = atlasSize/2; in make_atlas() local 31 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas() 35 r = SkRect::MakeXYWH(SkIntToScalar(kBlockSize), 0, in make_atlas() 36 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas() 40 r = SkRect::MakeXYWH(0, SkIntToScalar(kBlockSize), in make_atlas() 41 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas() 45 r = SkRect::MakeXYWH(SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize), in make_atlas() 46 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in make_atlas()
|
D | bleed.cpp | 227 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase1() 243 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase2() 262 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase3() 278 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase4() 296 SkIntToScalar(kBlockSize), SkIntToScalar(kBlockSize)); in drawCase5() 325 constexpr SkScalar kBottom = SkIntToScalar(kRow4Y + kBlockSize + kBlockSpacing); in onDraw() 394 SkScalar x = kBlockSize + SkTMax(SkTMax(corners[0].fX, corners[1].fX), in onDraw() 408 static constexpr int kBlockSize = 70; member in BleedGM 412 static constexpr int kCol1X = 2*kBlockSpacing + kBlockSize; 413 static constexpr int kCol2X = 3*kBlockSpacing + 2*kBlockSize; [all …]
|
/external/libvpx/libvpx/third_party/libyuv/source/ |
D | compare.cc | 33 const int kBlockSize = 1 << 15; // 32768; in HashDjb2() local 48 while (count >= (uint64_t)(kBlockSize)) { in HashDjb2() 49 seed = HashDjb2_SSE(src, kBlockSize, seed); in HashDjb2() 50 src += kBlockSize; in HashDjb2() 51 count -= kBlockSize; in HashDjb2() 124 const int kBlockSize = 1 << 15; // 32768; in ComputeHammingDistance() local 127 int remainder = count & (kBlockSize - 1) & ~(kSimdSize - 1); in ComputeHammingDistance() 160 for (i = 0; i < (count - (kBlockSize - 1)); i += kBlockSize) { in ComputeHammingDistance() 161 diff += HammingDistance(src_a + i, src_b + i, kBlockSize); in ComputeHammingDistance() 163 src_a += count & ~(kBlockSize - 1); in ComputeHammingDistance() [all …]
|
/external/libaom/libaom/test/ |
D | noise_model_test.cc | 349 const int kBlockSize = 16; in TYPED_TEST_P() local 351 ASSERT_EQ(1, aom_flat_block_finder_init(&flat_block_finder, kBlockSize, in TYPED_TEST_P() 356 const int h = 2 * kBlockSize; in TYPED_TEST_P() 357 const int w = 2 * kBlockSize; in TYPED_TEST_P() 358 const int stride = 2 * kBlockSize; in TYPED_TEST_P() 364 for (int y = 0; y < kBlockSize; ++y) { in TYPED_TEST_P() 365 for (int x = 0; x < kBlockSize; ++x) { in TYPED_TEST_P() 367 this->data_[y * stride + x + kBlockSize] = in TYPED_TEST_P() 371 std::vector<double> block(kBlockSize * kBlockSize, 1); in TYPED_TEST_P() 372 std::vector<double> plane(kBlockSize * kBlockSize, 1); in TYPED_TEST_P() [all …]
|
/external/webrtc/webrtc/common_audio/ |
D | blocker_unittest.cc | 128 const size_t kBlockSize = 4; in TEST_F() local 146 const float kWindow[kBlockSize] = {2.f, 2.f, 2.f, 2.f}; in TEST_F() 154 kBlockSize, in TEST_F() 181 const size_t kBlockSize = 4; in TEST_F() local 199 const float kWindow[kBlockSize] = {2.f, 2.f, 2.f, 2.f}; in TEST_F() 207 kBlockSize, in TEST_F() 234 const size_t kBlockSize = 4; in TEST_F() local 252 const float kWindow[kBlockSize] = {2.f, 2.f, 2.f, 2.f}; in TEST_F() 260 kBlockSize, in TEST_F() 289 const size_t kBlockSize[] = in TEST_F() local [all …]
|
/external/compiler-rt/test/tsan/ |
D | java_move_overlap.cc | 32 const int kBlockSize = 64; in main() local 36 varaddr2_old = (jptr)jheap + kBlockSize - 1; in main() 37 lockaddr2_old = (jptr)jheap + kBlockSize - 16; in main() 53 __tsan_java_alloc(varaddr1_old, kBlockSize); in main() 65 __tsan_java_move(varaddr1_old, varaddr1_new, kBlockSize); in main() 68 __tsan_java_free(varaddr1_new, kBlockSize); in main()
|
D | java_move_overlap_race.cc | 24 const int kBlockSize = 64; in main() local 27 varaddr2_old = (jptr)jheap + kBlockSize - 1; in main() 37 __tsan_java_alloc(varaddr1_old, kBlockSize); in main() 45 __tsan_java_move(varaddr1_old, varaddr1_new, kBlockSize); in main() 48 __tsan_java_free(varaddr1_new, kBlockSize); in main()
|
D | java_race_move.cc | 18 const int kBlockSize = 64; in main() local 20 __tsan_java_alloc(jheap, kBlockSize); in main() 26 __tsan_java_move(varaddr, varaddr2, kBlockSize); in main() 29 __tsan_java_free(varaddr2, kBlockSize); in main()
|
D | java_lock_move.cc | 22 const int kBlockSize = 64; in main() local 24 __tsan_java_alloc(jheap, kBlockSize); in main() 34 __tsan_java_move(varaddr, varaddr2, kBlockSize); in main() 37 __tsan_java_free(varaddr2, kBlockSize); in main()
|
D | java_race.cc | 15 const int kBlockSize = 16; in main() local 16 __tsan_java_alloc(jheap, kBlockSize); in main() 22 __tsan_java_free(jheap, kBlockSize); in main()
|
D | java_finalizer.cc | 16 const int kBlockSize = 16; in main() local 17 __tsan_java_alloc(jheap, kBlockSize); in main() 23 __tsan_java_free(jheap, kBlockSize); in main()
|
D | java_race_pc.cc | 25 const int kBlockSize = 16; in main() local 26 __tsan_java_alloc(jheap, kBlockSize); in main() 32 __tsan_java_free(jheap, kBlockSize); in main()
|
/external/libyuv/files/source/ |
D | compare.cc | 33 const int kBlockSize = 1 << 15; // 32768; in HashDjb2() local 47 while (count >= (uint64)(kBlockSize)) { in HashDjb2() 48 seed = HashDjb2_SSE(src, kBlockSize, seed); in HashDjb2() 49 src += kBlockSize; in HashDjb2() 50 count -= kBlockSize; in HashDjb2() 121 const int kBlockSize = 65536; in ComputeSumSquareError() local 122 int remainder = count & (kBlockSize - 1) & ~31; in ComputeSumSquareError() 147 for (i = 0; i < (count - (kBlockSize - 1)); i += kBlockSize) { in ComputeSumSquareError() 148 sse += SumSquareError(src_a + i, src_b + i, kBlockSize); in ComputeSumSquareError() 150 src_a += count & ~(kBlockSize - 1); in ComputeSumSquareError() [all …]
|
/external/libaom/libaom/third_party/libyuv/source/ |
D | compare.cc | 50 const int kBlockSize = 1 << 15; // 32768; in HashDjb2() local 64 while (count >= (uint64)(kBlockSize)) { in HashDjb2() 65 seed = HashDjb2_SSE(src, kBlockSize, seed); in HashDjb2() 66 src += kBlockSize; in HashDjb2() 67 count -= kBlockSize; in HashDjb2() 154 const int kBlockSize = 65536; in ComputeSumSquareError() local 155 int remainder = count & (kBlockSize - 1) & ~31; in ComputeSumSquareError() 180 for (i = 0; i < (count - (kBlockSize - 1)); i += kBlockSize) { in ComputeSumSquareError() 181 sse += SumSquareError(src_a + i, src_b + i, kBlockSize); in ComputeSumSquareError() 183 src_a += count & ~(kBlockSize - 1); in ComputeSumSquareError() [all …]
|
/external/libyuv/files/util/ |
D | compare.cc | 31 const int kBlockSize = 32768; in main() local 32 uint8 buf1[kBlockSize]; in main() 33 uint8 buf2[kBlockSize]; in main() 41 amt1 = static_cast<int>(fread(buf1, 1, kBlockSize, fin1)); in main() 45 amt2 = static_cast<int>(fread(buf2, 1, kBlockSize, fin2)); in main()
|
D | psnr.cc | 255 const int kBlockSize = 1 << 15; in ComputeSumSquareError() local 260 for (int i = 0; i < (count - (kBlockSize - 1)); i += kBlockSize) { in ComputeSumSquareError() 261 sse += SumSquareError(src_a + i, src_b + i, kBlockSize); in ComputeSumSquareError() 263 src_a += count & ~(kBlockSize - 1); in ComputeSumSquareError() 264 src_b += count & ~(kBlockSize - 1); in ComputeSumSquareError() 265 int remainder = count & (kBlockSize - 1) & ~15; in ComputeSumSquareError()
|
/external/lzma/CPP/7zip/Common/ |
D | StreamUtils.cpp | 7 static const UInt32 kBlockSize = ((UInt32)1 << 31); variable 15 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize; in ReadStream() 46 UInt32 curSize = (size < kBlockSize) ? (UInt32)size : kBlockSize; in WriteStream()
|
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
D | rtcp_utility_unittest.cc | 107 const size_t kBlockSize = 3; in TEST_F() local 108 ByteWriter<uint16_t>::WriteBigEndian(&buffer[2], kBlockSize); in TEST_F() 109 const size_t kSizeInBytes = (kBlockSize + 1) * 4; in TEST_F() 122 const size_t kBlockSize = 3; in TEST_F() local 123 ByteWriter<uint16_t>::WriteBigEndian(&buffer[2], kBlockSize); in TEST_F() 124 const size_t kSizeInBytes = (kBlockSize + 1) * 4; in TEST_F()
|
/external/tensorflow/tensorflow/lite/kernels/internal/reference/ |
D | portable_tensor_utils.cc | 116 const int kBlockSize = 16; in PortableSparseMatrixBatchVectorMultiplyAccumulate() local 118 m_cols % kBlockSize, 0); in PortableSparseMatrixBatchVectorMultiplyAccumulate() 129 const int block_start_index = *ledger_ptr++ * kBlockSize; in PortableSparseMatrixBatchVectorMultiplyAccumulate() 132 for (int c = 0; c < kBlockSize; c++) { in PortableSparseMatrixBatchVectorMultiplyAccumulate() 148 const int kBlockSize = 16; in PortableSparseMatrixBatchVectorMultiplyAccumulate() local 150 m_cols % kBlockSize, 0); in PortableSparseMatrixBatchVectorMultiplyAccumulate() 168 const int block_start_index = *ledger_ptr++ * kBlockSize; in PortableSparseMatrixBatchVectorMultiplyAccumulate() 170 for (int c = 0; c < kBlockSize; c++) { in PortableSparseMatrixBatchVectorMultiplyAccumulate()
|