| /external/libvpx/libvpx/test/ |
| intrapred_test.cc | 36 block_size_ = block_size;
47 for (int x = -1 ; x <= block_size_; x++)
49 for (int y = 0; y < block_size_; y++)
59 for (int i = -1; i < block_size_; ++i)
66 memset(&data_ptr_[p][-1 - stride_], 127, block_size_ + 2);
75 switch (block_size_) {
94 for (int x = 0; x < block_size_; x++)
97 for (int y = 0; y < block_size_; y++)
104 for (int y = 1; y < block_size_; ++y)
106 block_size_));
207 int block_size_; member in class:__anon10897::IntraPredBase
[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/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/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/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.cc | 85 block_size_.resize(num_blocks_);
87 block_size_[i] = bs.cols[i + options_.elimination_groups[0]].size;
198 m_.reset(new BlockRandomAccessSparseMatrix(block_size_, block_pairs_));
427 m.block(r, c, block_size_[block1], block_size_[block2]) *= 0.5;
447 factor_ = ss_.BlockAnalyzeCholesky(lhs, block_size_, block_size_);
|
| visibility_based_preconditioner_test.cc | 182 return preconditioner_->block_size_; }
185 return &preconditioner_->block_size_; }
|
| visibility_based_preconditioner.h | 217 vector<int> block_size_; member in class:ceres::internal::VisibilityBasedPreconditioner
|
| /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...] |
