| /external/libvpx/libvpx/test/ |
| intrapred_test.cc | 49 block_size_ = block_size;
60 for (int x = -1 ; x <= block_size_; x++)
62 for (int y = 0; y < block_size_; y++)
72 for (int i = -1; i < block_size_; ++i)
79 memset(&data_ptr_[p][-1 - stride_], 127, block_size_ + 2);
88 switch (block_size_) {
107 for (int x = 0; x < block_size_; x++)
110 for (int y = 0; y < block_size_; y++)
117 for (int y = 1; y < block_size_; ++y)
119 block_size_));
220 int block_size_; member in class:__anon21166::IntraPredBase
[all...] |
| variance_test.cc | 94 block_size_ = width_ * height_;
95 src_ = new uint8_t[block_size_];
96 ref_ = new uint8_t[block_size_];
117 int block_size_; member in class:__anon21178::VarianceTest
124 memset(src_, i, block_size_);
126 memset(ref_, j, block_size_);
138 for (int j = 0; j < block_size_; j++) {
154 memset(src_, 255, block_size_);
155 const int half = block_size_ / 2;
161 const unsigned int expected = block_size_ * 255 * 255 / 4
235 int block_size_; member in class:__anon21178::SubpelVarianceTest
[all...] |
| /external/chromium/crypto/ |
| encryptor_win.cc | 34 block_size_(0) {
59 block_size_ = GetCipherBlockSize(capi_key_.get());
60 if (block_size_ == 0)
63 if (iv.size() != block_size_)
82 DWORD total_len = data_len + block_size_;
|
| encryptor.h | 63 DWORD block_size_; member in class:crypto::Encryptor
|
| /external/ceres-solver/internal/ceres/ |
| schur_jacobi_preconditioner.cc | 59 block_size_.resize(num_blocks);
64 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size;
66 num_block_diagonal_entries += block_size_[i] * block_size_[i];
69 m_.reset(new BlockRandomAccessSparseMatrix(block_size_, block_pairs));
124 for (int i = 0; i < block_size_.size(); ++i) {
125 const int block_size = block_size_[i];
|
| visibility_based_preconditioner.cc | 85 block_size_.resize(num_blocks_);
87 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size;
177 m_.reset(new BlockRandomAccessSparseMatrix(block_size_, block_pairs_));
405 m.block(r, c, block_size_[block1], block_size_[block2]) *= 0.5;
424 factor_ = ss_.BlockAnalyzeCholesky(lhs, block_size_, block_size_);
|
| schur_jacobi_preconditioner.h | 99 vector<int> block_size_; member in class:ceres::internal::SchurJacobiPreconditioner
|
| visibility_based_preconditioner_test.cc | 189 // return preconditioner_->block_size_; }
192 // return &preconditioner_->block_size_; }
|
| visibility_based_preconditioner.h | 172 vector<int> block_size_; member in class:ceres::internal::VisibilityBasedPreconditioner
|
| /external/chromium_org/media/base/ |
| sinc_resampler.cc | 18 // block_size_ == r4_ - r2_
26 // and block_size_ are reinitialized via step (3) in the algorithm below.
49 // r0_ and choose block_size_ as the distance in frames between r4_ and r2_:
53 // block_size_ = r4_ - r2_ = request_frames_ - kKernelSize / 2
69 // r3_, r4_, and block_size_ then need to be reinitialized, so goto (3).
160 CHECK_GT(block_size_, kKernelSize)
184 block_size_ = r4_ - r2_;
279 for (int i = ceil((block_size_ - virtual_source_idx_) / current_io_ratio);
281 DCHECK_LT(virtual_source_idx_, block_size_);
321 virtual_source_idx_ -= block_size_;
[all...] |
| sinc_resampler.h | 116 int block_size_; member in class:media::SincResampler
|
| /external/chromium_org/third_party/re2/util/ |
| arena.cc | 17 : block_size_(block_size),
25 first_blocks_[0].mem = reinterpret_cast<char*>(malloc(block_size_));
26 first_blocks_[0].size = block_size_;
109 if (block_size_ == 0 || size > block_size_/4) {
129 AllocatedBlock *block = AllocNewBlock(block_size_);
|
| arena.h | 73 const size_t block_size_; member in class:re2::UnsafeArena
|
| /external/regex-re2/util/ |
| arena.cc | 17 : block_size_(block_size),
25 first_blocks_[0].mem = reinterpret_cast<char*>(malloc(block_size_));
26 first_blocks_[0].size = block_size_;
109 if (block_size_ == 0 || size > block_size_/4) {
129 AllocatedBlock *block = AllocNewBlock(block_size_);
|
| arena.h | 73 const size_t block_size_; member in class:re2::UnsafeArena
|
| /external/chromium_org/third_party/protobuf/src/google/protobuf/io/ |
| zero_copy_stream_impl_lite.cc | 58 block_size_(block_size > 0 ? block_size : size),
68 last_returned_size_ = min(block_size_, size_ - position_);
111 block_size_(block_size > 0 ? block_size : size),
121 last_returned_size_ = min(block_size_, size_ - position_);
|
| zero_copy_stream_impl_lite.h | 82 const int block_size_; // How many bytes to return at a time. member in class:google::protobuf::io::ArrayInputStream
114 const int block_size_; // How many bytes to return at a time. member in class:google::protobuf::io::ArrayOutputStream
|
| /external/protobuf/src/google/protobuf/io/ |
| zero_copy_stream_impl_lite.cc | 56 block_size_(block_size > 0 ? block_size : size),
66 last_returned_size_ = min(block_size_, size_ - position_);
109 block_size_(block_size > 0 ? block_size : size),
119 last_returned_size_ = min(block_size_, size_ - position_);
|
| zero_copy_stream_impl_lite.h | 82 const int block_size_; // How many bytes to return at a time. member in class:google::protobuf::io::ArrayInputStream
114 const int block_size_; // How many bytes to return at a time. member in class:google::protobuf::io::ArrayOutputStream
|
| /external/v8/src/ |
| parser.cc | 832 block_size_(0) {}
912 block_size_ = 1;
917 ++block_size_;
921 if (block_size_ >= kMinInitializationBlock) {
926 block_size_ = 0;
934 int block_size_; member in class:v8::internal::InitializationBlockFinder
[all...] |
