| /external/libvpx/libvpx/test/ |
| D | intrapred_test.cc | 44 block_size_ = block_size; in SetupMacroblock()
55 for (int x = -1 ; x <= block_size_; x++) in FillRandom()
57 for (int y = 0; y < block_size_; y++) in FillRandom()
67 for (int i = -1; i < block_size_; ++i) in SetLeftUnavailable()
74 memset(&data_ptr_[p][-1 - stride_], 127, block_size_ + 2); in SetTopUnavailable()
83 switch (block_size_) { in BlockSizeLog2Min1()
102 for (int x = 0; x < block_size_; x++) in CheckDCPrediction()
105 for (int y = 0; y < block_size_; y++) in CheckDCPrediction()
112 for (int y = 1; y < block_size_; ++y) in CheckDCPrediction()
114 block_size_)); in CheckDCPrediction()
[all …]
|
| D | variance_test.cc | 92 block_size_ = width_ * height_; in SetUp()
93 src_ = reinterpret_cast<uint8_t *>(vpx_memalign(16, block_size_)); in SetUp()
94 ref_ = new uint8_t[block_size_]; in SetUp()
115 int block_size_; member in __anon9f3513840111::VarianceTest
122 memset(src_, i, block_size_); in ZeroTest()
124 memset(ref_, j, block_size_); in ZeroTest()
137 for (int j = 0; j < block_size_; j++) { in RefTest()
154 memset(src_, 255, block_size_); in OneQuarterTest()
155 const int half = block_size_ / 2; in OneQuarterTest()
161 const unsigned int expected = block_size_ * 255 * 255 / 4; in OneQuarterTest()
[all …]
|
| /external/regex-re2/util/ |
| D | arena.cc | 17 : block_size_(block_size), in UnsafeArena()
25 first_blocks_[0].mem = reinterpret_cast<char*>(malloc(block_size_)); in UnsafeArena()
26 first_blocks_[0].size = block_size_; in UnsafeArena()
109 if (block_size_ == 0 || size > block_size_/4) { in GetMemoryFallback()
129 AllocatedBlock *block = AllocNewBlock(block_size_); in GetMemoryFallback()
|
| D | arena.h | 73 const size_t block_size_; variable
|
| /external/ceres-solver/internal/ceres/ |
| D | schur_jacobi_preconditioner.cc | 58 block_size_.resize(num_blocks); in SchurJacobiPreconditioner()
60 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size; in SchurJacobiPreconditioner()
63 m_.reset(new BlockRandomAccessDiagonalMatrix(block_size_)); in SchurJacobiPreconditioner()
114 for (int i = 0; i < block_size_.size(); ++i) { in RightMultiply()
115 const int block_size = block_size_[i]; in RightMultiply()
|
| D | visibility_based_preconditioner.cc | 89 block_size_.resize(num_blocks_); in VisibilityBasedPreconditioner()
91 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size; in VisibilityBasedPreconditioner()
181 m_.reset(new BlockRandomAccessSparseMatrix(block_size_, block_pairs_)); in InitStorage()
424 m.block(r, c, block_size_[block1], block_size_[block2]) *= 0.5; in ScaleOffDiagonalCells()
446 factor_ = ss_.BlockAnalyzeCholesky(lhs, block_size_, block_size_, &status); in Factorize()
|
| D | schur_jacobi_preconditioner.h | 99 vector<int> block_size_; variable
|
| D | visibility_based_preconditioner.h | 173 vector<int> block_size_; variable
|
| /external/protobuf/src/google/protobuf/io/ |
| D | zero_copy_stream_impl_lite.cc | 60 block_size_(block_size > 0 ? block_size : size), in ArrayInputStream()
70 last_returned_size_ = min(block_size_, size_ - position_); in Next()
113 block_size_(block_size > 0 ? block_size : size), in ArrayOutputStream()
123 last_returned_size_ = min(block_size_, size_ - position_); in Next()
|
| D | zero_copy_stream_impl_lite.h | 83 const int block_size_; // How many bytes to return at a time. variable
115 const int block_size_; // How many bytes to return at a time. variable
|
| /external/webp/src/enc/ |
| D | backward_references.c | 105 refs->block_size_ = in VP8LBackwardRefsInit()
134 sizeof(*b) + refs->block_size_ * sizeof(*b->start_); in BackwardRefsNewBlock()
155 if (b == NULL || b->size_ == refs->block_size_) { in BackwardRefsCursorAdd()
166 assert(src->block_size_ == dst->block_size_); in VP8LBackwardRefsCopy()
|
| D | backward_references.h | 148 int block_size_; // common block-size member
|
| D | vp8l.c | 583 VP8LBackwardRefsInit(&refs, refs_array[0].block_size_); in EncodeImageInternal()
|