HomeSort by relevance Sort by last modified time
    Searched defs:size_ (Results 101 - 125 of 237) sorted by null

1 2 3 45 6 7 8 910

  /external/stressapptest/src/
disk_blocks.h 58 void set_size(uint64 size) { size_ = size; }
59 uint64 size() const { return size_; }
64 uint64 size_; // Size of block member in class:BlockData
167 uint64 size_; // Number of elements on table member in class:DiskBlockTable
  /external/v8/src/
collector.h 28 : index_(0), size_(0) {
47 size_++;
61 size_ += size;
78 size_ += source.length();
87 DCHECK(size_ <= destination.length());
107 Vector<T> new_store = Vector<T>::New(size_);
119 size_ = 0;
123 inline int size() { return size_; }
130 int size_; // Total number of elements in collector. member in class:v8::internal::Collector
207 this->size_ -= sequence_length
    [all...]
identity-map.h 21 bool empty() const { return size_ == 0; }
22 int size() const { return size_; }
36 size_(0),
72 int size_; member in class:v8::internal::IdentityMapBase
  /external/v8/src/compiler/
memory-optimizer.h 54 Node* size() const { return size_; }
59 Node* const size_; member in class:v8::internal::compiler::final::final
82 int size() const { return size_; }
92 int const size_; member in class:v8::internal::compiler::final::final
  /external/webp/src/enc/
backward_references_enc.h 126 int size_; member in struct:VP8LHashChain
  /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/io/
zero_copy_stream_impl_lite.h 88 const int size_; // Total size of the array. member in class:google::protobuf::io::ArrayInputStream
120 const int size_; // Total size of the array. member in class:google::protobuf::io::ArrayOutputStream
  /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/stubs/
bytestream.h 196 size_t NumberOfBytesWritten() const { return size_; }
205 size_t size_; member in class:google::protobuf::strings::CheckedArrayByteSink
242 size_t size_; member in class:google::protobuf::strings::GrowingArrayByteSink
  /system/keymaster/include/keymaster/
android_keymaster_utils.h 147 explicit Eraser(T& t) : buf_(reinterpret_cast<uint8_t*>(&t)), size_(sizeof(t)) {}
149 template <size_t N> explicit Eraser(uint8_t (&arr)[N]) : buf_(arr), size_(N) {} function in class:keymaster::Eraser
151 Eraser(void* buf, size_t size) : buf_(static_cast<uint8_t*>(buf)), size_(size) {}
152 ~Eraser() { memset_s(buf_, 0, size_); }
159 size_t size_; member in class:keymaster::Eraser
  /toolchain/binutils/binutils-2.25/gold/
nacl.h 45 : offset_(file_offset), size_(data_size)
52 { return this->size_; }
56 section_size_type size_; member in class:gold::Sniff_file::Location
target-select.h 124 { return this->size_; }
160 // match the machine_, size_, and is_big_endian_ fields. The child
227 const int size_; member in class:gold::Target_selector
  /art/compiler/jit/
jit_logger.cc 115 uint32_t size_; // Total size of header member in struct:art::jit::PerfJitHeader
154 uint32_t size_; // Total size of this event record. member in struct:art::jit::PerfJitBase
238 header.size_ = sizeof(header);
277 jit_code.size_ = sizeof(jit_code) + method_name.size() + 1 + code_size;
  /external/gemmlowp/eight_bit_int_gemm/
eight_bit_int_gemm.cc 148 Scratch() : buffer_(), buffer_32_(nullptr), size_(0) {}
151 if (size_ >= required_size) {
159 size_ = required_size;
165 size_ = 0;
173 std::int32_t size_; member in class:gemmlowp::eight_bit_int_gemm::__anon19488::Scratch
  /external/google-breakpad/src/client/linux/minidump_writer/
linux_ptrace_dumper_unittest.cc 154 : fd_(-1), mapping_(NULL), size_(0) {}
156 if (size_)
157 munmap(mapping_, size_);
164 size_ = size;
168 size_t size() const { return size_; }
173 size_t size_; member in class:StackHelper
  /external/google-breakpad/src/processor/
stackwalker_unittest_utils.h 108 : base_address_(base_address), size_(size), code_file_(code_file) { }
111 uint64_t size() const { return size_; }
123 uint64_t size_; member in class:MockCodeModule
  /external/libchrome/base/containers/
small_map.h 200 SmallMap() : size_(0), functor_(MapInit()) {}
202 explicit SmallMap(const MapInit& functor) : size_(0), functor_(functor) {}
206 // size_ and functor_ are initted in InitFrom()
389 if (size_ >= 0) {
390 for (int i = 0; i < size_; i++) {
395 return iterator(array_ + size_);
403 if (size_ >= 0) {
404 for (int i = 0; i < size_; i++) {
409 return const_iterator(array_ + size_);
419 if (size_ >= 0)
571 int size_; \/\/ negative = using hash_map member in class:base::SmallMap
    [all...]
  /external/libchrome/base/
values.h 188 size_t GetSize() const { return size_; }
201 size_t size_; member in class:base::BinaryValue
  /external/libchrome/sandbox/win/src/
crosscall_params.h 69 uint32_t size_; member in struct:sandbox::ParamInfo
257 param_info_[index].size_ = size;
  /external/libcxxabi/src/
cxa_vector.cpp 64 : dealloc_ ( dealloc ), ptr_ ( ptr ), size_ ( size ), enabled_ ( true ) {}
65 ~st_heap_block3 () { if ( enabled_ ) dealloc_ ( ptr_, size_ ) ; }
71 size_t size_; member in class:__cxxabiv1::__anon23151::st_heap_block3
  /external/libmojo/base/android/linker/
modern_linker_jni.cc 205 ~ScopedAnonymousMmap() { munmap(addr_, size_); }
208 void Release() { addr_ = nullptr; size_ = 0; effective_addr_ = nullptr; }
212 size_t size_; member in class:chromium_android_linker::__anon23651::ScopedAnonymousMmap
233 size_ = 0;
245 size_ = size;
248 size_ = 0;
  /external/libmojo/mojo/edk/system/
channel.cc 74 size_ = sizeof(Header) + extra_header_size + payload_size;
75 data_ = static_cast<char*>(base::AlignedAlloc(size_,
85 DCHECK_LE(size_, std::numeric_limits<uint32_t>::max());
86 header_->num_bytes = static_cast<uint32_t>(size_);
208 return size_ - header_->num_header_bytes;
372 size_ = kReadBufferSize;
373 data_ = static_cast<char*>(base::AlignedAlloc(size_,
391 if (num_occupied_bytes_ + num_bytes > size_) {
392 size_ = std::max(size_ * 2, num_occupied_bytes_ + num_bytes)
458 size_t size_ = 0; member in class:mojo::edk::Channel::ReadBuffer
    [all...]
channel.h 117 size_t data_num_bytes() const { return size_; }
165 size_t size_; member in struct:mojo::edk::Channel::Message
  /external/libvpx/libvpx/test/
partial_idct_test.cc 75 case TX_4X4: size_ = 4; break;
76 case TX_8X8: size_ = 8; break;
77 case TX_16X16: size_ = 16; break;
78 case TX_32X32: size_ = 32; break;
84 if (stride_ < size_) {
85 stride_ = size_;
92 input_block_size_ = size_ * size_;
93 output_block_size_ = size_ * stride_;
149 for (int y = 0; y < size_; y++)
173 int size_; member in class:__anon24585::PartialIDctTest
    [all...]
  /external/regex-re2/util/
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_], and then increment size_
223 int size_; member in class:re2::SparseArray
    [all...]
  /external/v8/src/base/platform/
platform.h 313 VirtualMemory(void* address, size_t size) : address_(address), size_(size) {}
338 size_t size() { return size_; }
354 size_t size = size_ - (reinterpret_cast<size_t>(free_start) -
359 reinterpret_cast<size_t>(address_) + size_));
360 bool result = ReleasePartialRegion(address_, size_, free_start, size);
363 size_ -= size;
371 size_t size = size_;
384 size_ = from->size_;
413 ((reinterpret_cast<uintptr_t>(address_) + size_) >
418 size_t size_; \/\/ Size of the virtual memory. member in class:v8::base::VirtualMemory
    [all...]
  /external/v8/src/crankshaft/
unique.h 150 UniqueSet() : size_(0), capacity_(0), array_(NULL) { }
154 : size_(0), capacity_(capacity),
161 : size_(1), capacity_(1), array_(zone->NewArray<Unique<T> >(1)) {
169 for (int i = 0; i < size_; i++) {
173 Grow(size_ + 1, zone);
174 for (int j = size_ - 1; j >= i; j--) array_[j + 1] = array_[j];
176 size_++;
181 Grow(size_ + 1, zone);
182 array_[size_++] = uniq;
187 for (int i = 0; i < size_; i++)
339 uint16_t size_; member in class:v8::internal::final
    [all...]

Completed in 794 milliseconds

1 2 3 45 6 7 8 910