/external/webrtc/src/system_wrappers/interface/ |
H A D | list_wrapper.h | 103 unsigned int size_; member in class:webrtc::ListWrapper
|
/external/webrtc/src/system_wrappers/source/ |
H A D | list_no_stl.h | 74 unsigned int size_; member in class:webrtc::ListNoStl
|
H A D | map_no_stl.h | 65 int size_; member in class:webrtc::MapNoStl
|
/external/vixl/src/a64/ |
H A D | macro-assembler-a64.h | 1236 size_ = 0; 1247 size_ = count * kInstructionSize; 1258 VIXL_ASSERT(masm_->SizeOfCodeGeneratedSince(&start_) == size_); 1267 uint64_t size_; member in class:vixl::InstructionAccurateScope
|
/external/webp/src/demux/ |
H A D | demux.c | 40 size_t size_; member in struct:__anon33350 224 frame->img_components_[1].size_ = chunk_size; 252 frame->img_components_[0].size_ = chunk_size; 386 chunk->data_.size_ = size; 439 if (!has_alpha && frame->img_components_[1].size_ > 0) { 441 frame->img_components_[1].size_ = 0; 657 if (alpha->size_ == 0 && image->size_ == 0) return 0; 659 if (alpha->size_ > 0 && alpha->offset_ > image->offset_) { 669 if (alpha->size_ > [all...] |
/external/webp/src/enc/ |
H A D | backward_references.c | 77 int size_; // currently used size member in struct:PixOrCopyBlock 114 c.last_pos_ = c.cur_pos + c.cur_block_->size_; 125 c->last_pos_ = (b == NULL) ? NULL : b->start_ + b->size_; 148 b->size_ = 0; 155 if (b == NULL || b->size_ == refs->block_size_) { 159 b->start_[b->size_++] = v; 170 memcpy(new_b->start_, b->start_, b->size_ * sizeof(*b->start_)); 171 new_b->size_ = b->size_; 184 for (i = 0; i < p->size_; [all...] |
H A D | backward_references.h | 130 int size_; member in struct:VP8LHashChain
|
H A D | vp8enci.h | 202 int size_; // bit-cost for transmitting the segment map member in struct:__anon33380
|
/external/webp/src/utils/ |
H A D | utils.c | 60 size_t size_; member in struct:MemBlock 120 b->size_ = size; 147 total_mem -= block->size_; 150 (uint32_t)total_mem, (uint32_t)block->size_);
|
/external/stressapptest/src/ |
H A D | disk_blocks.h | 49 int64 size_; // size of block member in class:BlockData
|
H A D | pattern.h | 100 int Size() {return size_;} 105 unsigned int size_; member in class:PatternList
|
H A D | sat.h | 117 // Allocates size_ bytes of test memory. 148 int64 size_; // Size of memory tested, in bytes. member in class:Sat
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | heap.h | 51 Heap(Compare comp) : comp_(comp), size_(0) { } 54 Heap() : size_(0) { } 60 if (size_ < (int)A_.size()) { 61 A_[size_] = val; 62 pos_[key_[size_]] = size_; 65 pos_.push_back(size_); 66 key_.push_back(size_); 69 ++size_; 70 return Insert(val, size_ 187 int size_; member in class:fst::Heap [all...] |
H A D | symbol-table.h | 330 size_ = impl_->symbols_.size(); 340 return (pos_ == size_); 367 size_t size_; member in class:fst::SymbolTableIterator
|
/external/regex-re2/re2/ |
H A D | prog.h | 203 int64 size() { return size_; } 349 int size_; // number of instructions member in class:re2::Prog
|
/external/regex-re2/util/ |
H A D | sparse_array.h | 57 // size_. 59 // The vector dense_ contains the size_ elements in the sparse array (with 62 // the size_ pairs are dense_[0] through dense_[size_-1]. 65 // [0,size_). 68 // any value at all, perhaps outside the range [0, size_) but perhaps not. 71 // the array very easy: set size_ to 0. Lookups are slightly more 73 // sparse_to_dense_[i] is in [0, size_) AND 79 // To insert a new entry, set sparse_to_dense_[i] to size_, 80 // initialize dense_[size_], an 223 int size_; member in class:re2::SparseArray [all...] |
H A D | sparse_set.h | 57 : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(NULL), valgrind_(RunningOnValgrind()) {} 72 size_ = 0; 83 int size() const { return size_; } 85 iterator end() { return dense_ + size_; } 87 const_iterator end() const { return dense_ + size_; } 92 if (size_ > new_max_size) 93 size_ = new_max_size; 108 memmove(a, dense_, size_*sizeof a[0]); 110 for (int i = size_; i < new_max_size; i++) 125 void clear() { size_ 168 int size_; member in class:re2::SparseSet [all...] |
/external/qemu/hw/net/ |
H A D | ne2000.c | 227 static ssize_t ne2000_receive(VLANClientState *vc, const uint8_t *buf, size_t size_) argument 230 int size = size_; 321 return size_;
|
/external/protobuf/src/google/protobuf/io/ |
H A D | zero_copy_stream_impl_lite.h | 81 const int size_; // Total size of the array. member in class:google::protobuf::io::ArrayInputStream 113 const int size_; // Total size of the array. member in class:google::protobuf::io::ArrayOutputStream
|
/external/protobuf/src/google/protobuf/stubs/ |
H A D | substitute.h | 90 : text_(value), size_(strlen(text_)) {} 92 : text_(value.data()), size_(value.size()) {} 96 : text_(NULL), size_(-1) {} 105 : text_(scratch_), size_(1) { scratch_[0] = value; } 107 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} 109 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} 111 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} 113 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} 115 : text_(FastLongToBuffer(value, scratch_)), size_(strlen(text_)) {} 117 : text_(FastULongToBuffer(value, scratch_)), size_(strle 134 int size_; member in class:google::protobuf::strings::internal::SubstituteArg [all...] |
/external/protobuf/gtest/samples/ |
H A D | sample3-inl.h | 78 Queue() : head_(NULL), last_(NULL), size_(0) {} 85 if (size_ > 0) { 98 size_ = 0; 103 size_t Size() const { return size_; } 120 if (size_ == 0) { 122 size_ = 1; 126 size_++; 133 if (size_ == 0) { 139 size_--; 140 if (size_ 166 size_t size_; // The number of elements in the queue. member in class:Queue [all...] |
/external/protobuf/gtest/src/ |
H A D | gtest-internal-inl.h | 255 Vector() : elements_(NULL), capacity_(0), size_(0) {} 263 for (int i = 0; i < size_; i++) { 269 capacity_ = size_ = 0; 274 int size() const { return size_; } 280 void PushBack(const E& element) { Insert(element, size_); } 290 if (size_ == 0) 305 MoveElements(index, size_ - index, index + 1); 307 size_++; 313 GTEST_CHECK_(0 <= index && index < size_) 315 << (size_ 420 << size_ << "]."; local 423 << begin << ", " << size_ << "]."; local 481 int size_; // The number of elements; in the range [0, capacity_]. member in class:testing::internal::Vector [all...] |
/external/openfst/src/include/fst/extensions/ngram/ |
H A D | bitmap-index.h | 47 BitmapIndex() : bits_(NULL), size_(0) { } 63 return size_; 67 return StorageSize(size_); 169 size_t size_; member in class:fst::BitmapIndex
|
/external/openfst/src/include/fst/ |
H A D | heap.h | 57 Heap(Compare comp) : comp_(comp), size_(0) { } 60 Heap() : size_(0) { } 66 if (size_ < A_.size()) { 67 A_[size_] = val; 68 pos_[key_[size_]] = size_; 71 pos_.push_back(size_); 72 key_.push_back(size_); 75 ++size_; 76 return Insert(val, size_ 199 int size_; member in class:fst::Heap [all...] |
/external/openssl/crypto/bio/ |
H A D | bss_bio.c | 187 static int bio_read(BIO *bio, char *buf, int size_) argument 189 size_t size = size_;
|