/external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
spacetodepth_op.cc | 37 OP_REQUIRES_OK(ctx, ctx->GetAttr("block_size", &block_size_)); 39 ctx, block_size_ > 1, 40 errors::InvalidArgument("Block size should be > 1: ", block_size_)); 68 OP_REQUIRES(ctx, input_shape[1 + i] % block_size_ == 0, 71 " is not divisible by block_size=", block_size_)); 72 block_elems *= block_size_; 77 reshaped_shape.push_back(input_shape[1 + i] / block_size_); 78 reshaped_shape.push_back(block_size_); 93 output_shape.push_back(input_shape[1 + i] / block_size_); 100 OP_REQUIRES(ctx, input_shape[2 + i] % block_size_ == 0 167 int block_size_; member in class:tensorflow::__anon38780::SpaceToDepthOp [all...] |
depthtospace_op.cc | 37 OP_REQUIRES_OK(ctx, ctx->GetAttr("block_size", &block_size_)); 39 ctx, block_size_ > 1, 40 errors::InvalidArgument("Block size should be > 1: ", block_size_)); 72 reshaped_shape.push_back(block_size_); 73 block_elems *= block_size_; 86 output_shape.push_back(input_shape[1 + i] * block_size_); 94 reshaped_shape.push_back(block_size_); 95 block_elems *= block_size_; 112 output_shape.push_back(input_shape[2 + i] * block_size_); 123 // block_size_, 163 int block_size_; member in class:tensorflow::__anon38738::DepthToSpaceOp [all...] |
batchtospace_op.cc | 168 OP_REQUIRES_OK(ctx, ctx->GetAttr("block_size", &block_size_)); 170 ctx, block_size_ > 1, 171 errors::InvalidArgument("Block size should be > 1: ", block_size_)); 179 {block_size_, block_size_}, crops); 183 int block_size_; member in class:tensorflow::__anon38726::BatchToSpaceOp
|
/frameworks/base/tools/aapt2/util/ |
BigBuffer.cpp | 30 if (block.block_size_ - block.size >= size) { 38 const size_t actual_size = std::max(block_size_, size); 47 block.block_size_ = actual_size; 57 if (block.size != block.block_size_) { 59 size_t size = block.block_size_ - block.size; 60 block.size = block.block_size_; 69 block.buffer = std::unique_ptr<uint8_t[]>(new uint8_t[block_size_]()); 71 block.size = block_size_; 72 block.block_size_ = block_size_; [all...] |
BigBuffer.h | 60 size_t block_size_; member in struct:aapt::BigBuffer::Block 131 size_t block_size_; member in class:aapt::BigBuffer 137 : block_size_(block_size), size_(0) {} 140 : block_size_(rhs.block_size_), 146 inline size_t BigBuffer::block_size() const { return block_size_; }
|
/external/tensorflow/tensorflow/core/kernels/ |
spacetodepth_op.cc | 52 OP_REQUIRES_OK(context, context->GetAttr("block_size", &block_size_)); 53 OP_REQUIRES(context, block_size_ > 1, 55 block_size_)); 94 (width % block_size_) == 0 && (height % block_size_) == 0, 97 " should be divisible by block_size: ", block_size_)); 99 // The 'spatial' block of size block_size_ X block_size_ will be moved 101 const int output_depth = input_depth * block_size_ * block_size_; 144 int block_size_; member in class:tensorflow::SpaceToDepthOp [all...] |
depthtospace_op.cc | 52 OP_REQUIRES_OK(context, context->GetAttr("block_size", &block_size_)); 53 OP_REQUIRES(context, block_size_ > 1, 55 block_size_)); 92 const int block_size_sq = block_size_ * block_size_; 94 // The depth must be divisible by block_size_ * block_size_ 101 const int output_width = input_width * block_size_; 102 const int output_height = input_height * block_size_; 121 functor(context->eigen_device<GPUDevice>(), Tinput_v, block_size_, 142 int block_size_; member in class:tensorflow::DepthToSpaceOp [all...] |
/system/update_engine/payload_generator/ |
block_mapping_unittest.cc | 60 size_t block_size_{1024}; 61 BlockMapping bm_{block_size_}; // BlockMapping under test. 65 brillo::Blob blob(block_size_); 75 test_utils::WriteFileString(old_part_path_, string(block_size_, 'a')); 89 brillo::Blob block(block_size_, 'a'); 107 string old_contents(10 * block_size_, '\0'); 109 old_contents[i] = 4 + i / block_size_; 114 string new_contents(6 * block_size_, '\0'); 116 new_contents[i] = i / block_size_; 124 block_size_, [all...] |
fake_filesystem.cc | 24 block_size_(block_size), 29 return block_size_;
|
raw_filesystem.cc | 31 result->block_size_ = block_size; 37 return block_size_;
|
delta_diff_utils_unittest.cc | 112 block_size_, block_size_ * kDefaultBlockCount); 114 block_size_, block_size_ * kDefaultBlockCount); 137 old_part_.size / block_size_, 138 new_part_.size / block_size_, 156 size_t block_size_{kBlockSize}; 165 brillo::Blob data_blob(block_size_); 492 InitializePartitionWithUniqueBlocks(old_part_, block_size_, 5); 493 InitializePartitionWithUniqueBlocks(new_part_, block_size_, 42) [all...] |
block_mapping.cc | 48 brillo::Blob blob(block_size_); 50 if (!utils::PReadAll(fd, blob.data(), block_size_, byte_offset, &bytes_read)) 52 if (static_cast<size_t>(bytes_read) != block_size_) 65 fd, initial_byte_offset + block * block_size_); 74 if (block_data.size() != block_size_)
|
/external/brotli/c/enc/ |
metablock_inc.h | 34 size_t block_size_; local 61 self->block_size_ = 0; 89 self->block_size_ = 90 BROTLI_MAX(size_t, self->block_size_, self->min_block_size_); 93 split->lengths[0] = (uint32_t)self->block_size_; 103 self->block_size_ = 0; 104 } else if (self->block_size_ > 0) { 125 split->lengths[self->num_blocks_] = (uint32_t)self->block_size_; 136 self->block_size_ = 0; 141 split->lengths[self->num_blocks_] = (uint32_t)self->block_size_; [all...] |
hash_longest_match_inc.h | 14 fixed size (block_size_). The ring buffer contains the last block_size_ 33 /* Only block_size_ newest backward references are kept, 35 size_t block_size_; member in struct:HashLongestMatch 46 /* Buckets containing block_size_ of backward references. */ 69 self->block_size_ = (size_t)1 << common->params.block_bits; 70 self->block_mask_ = (uint32_t)(self->block_size_ - 1); 216 (num[key] > self->block_size_) ? (num[key] - self->block_size_) : 0u;
|
metablock.c | 185 size_t block_size_; member in struct:ContextBlockSplitter 214 self->block_size_ = 0; 250 if (self->block_size_ < self->min_block_size_) { 251 self->block_size_ = self->min_block_size_; 256 split->lengths[0] = (uint32_t)self->block_size_; 271 self->block_size_ = 0; 272 } else if (self->block_size_ > 0) { 305 split->lengths[self->num_blocks_] = (uint32_t)self->block_size_; 320 self->block_size_ = 0; 325 split->lengths[self->num_blocks_] = (uint32_t)self->block_size_; [all...] |
hash_longest_match64_inc.h | 14 fixed size (block_size_). The ring buffer contains the last block_size_ 35 /* Only block_size_ newest backward references are kept, 37 size_t block_size_; member in struct:HashLongestMatch 50 /* Buckets containing block_size_ of backward references. */ 74 self->block_size_ = (size_t)1 << common->params.block_bits; 75 self->block_mask_ = (uint32_t)(self->block_size_ - 1); 223 (num[key] > self->block_size_) ? 224 (num[key] - self->block_size_) : 0u;
|
/system/update_engine/payload_consumer/ |
extent_reader.cc | 34 block_size_ = block_size; 42 total_size_ += extent.num_blocks() * block_size_; 72 cur_extent_->num_blocks() * block_size_ - cur_extent_bytes_read_; 81 cur_extent_->start_block() * block_size_ + cur_extent_bytes_read_, 89 if (cur_extent_bytes_read_ == cur_extent_->num_blocks() * block_size_) {
|
extent_writer.h | 73 block_size_ = block_size; 84 size_t block_size_{0}; 94 // of bytes written is a multiple of block_size_. If not, it writes zeros 107 block_size_ = block_size; 113 bytes_written_mod_block_size_ %= block_size_; 120 const size_t write_size = block_size_ - bytes_written_mod_block_size_; 130 size_t block_size_{0};
|
extent_writer.cc | 40 cur_extent_->num_blocks() * block_size_ - extent_bytes_written_; 49 cur_extent_->start_block() * block_size_ + extent_bytes_written_; 59 CHECK_EQ(extent_bytes_written_, cur_extent_->num_blocks() * block_size_);
|
/external/webrtc/webrtc/common_audio/ |
blocker.cc | 109 block_size_(block_size), 112 initial_delay_(block_size_ - gcd(chunk_size, shift_amount)), 116 input_block_(block_size_, num_input_channels_), 117 output_block_(block_size_, num_output_channels_), 118 window_(new float[block_size_]), 122 RTC_CHECK_LE(shift_amount_, block_size_); 124 memcpy(window_.get(), window, block_size_ * sizeof(*window_.get())); 182 block_size_); 183 input_buffer_.MoveReadPositionBackward(block_size_ - shift_amount_); 186 block_size_, [all...] |
/bionic/linker/ |
linker_block_allocator.cpp | 53 : block_size_( 67 reinterpret_cast<char*>(free_block_list_) + block_size_); 75 memset(block_info, 0, block_size_); 93 if (offset % block_size_ != 0) { 97 memset(block, 0, block_size_); 130 first_block->num_free_blocks = (PAGE_SIZE - sizeof(LinkerBlockAllocatorPage*))/block_size_;
|
linker_allocator.cpp | 88 : type_(type), block_size_(block_size), free_pages_cnt_(0), free_blocks_list_(nullptr) {} 91 CHECK(block_size_ != 0); 100 reinterpret_cast<uint8_t*>(block_record) + block_size_); 118 memset(block_record, 0, block_size_); 153 if (offset % block_size_ != 0) { 154 async_safe_fatal("invalid pointer: %p (block_size=%zd)", ptr, block_size_); 157 memset(ptr, 0, block_size_); 185 async_safe_fatal("page record for %p was not found (block_size=%zd)", ptr, block_size_); 216 size_t free_blocks_cnt = (PAGE_SIZE - sizeof(page_info))/block_size_;
|
/external/webrtc/webrtc/modules/audio_coding/neteq/ |
time_stretch_unittest.cc | 65 block_size_(30 * sample_rate_hz_ / 1000), // 30 ms 66 audio_(new int16_t[block_size_]), 72 RTC_CHECK(input_file_->Read(block_size_, audio_.get())); 84 UpdateReturnStats(accelerate.Process(Next30Ms(), block_size_, fast_mode, 105 const size_t block_size_; member in class:webrtc::TimeStretchTest
|
/external/tensorflow/tensorflow/core/platform/cloud/ |
file_block_cache.cc | 82 if (block->data.size() < block_size_) { 127 block->data.resize(block_size_, 0); 129 status.Update(block_fetcher_(key.first, key.second, block_size_, 163 if (block_size_ == 0 || max_bytes_ == 0) { 169 size_t start = block_size_ * (offset / block_size_); 170 size_t finish = block_size_ * ((offset + n) / block_size_); 172 finish += block_size_; 176 for (size_t pos = start; pos < finish; pos += block_size_) { [all...] |
/external/protobuf/src/google/protobuf/stubs/ |
bytestream_unittest.cc | 51 : data_(data), block_size_(block_size) {} 55 return data_.substr(0, block_size_); 61 int block_size_; member in class:google::protobuf::strings::__anon32399::MockByteSource
|