Home
last modified time | relevance | path

Searched refs:size_ (Results 1 - 25 of 237) sorted by relevance

12345678910

/third_party/spirv-tools/source/util/
H A Dsmall_vector.h50 : size_(0), in SmallVector()
62 size_ = vec.size(); in SmallVector()
63 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
78 size_ = vec.size(); in SmallVector()
79 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
89 new (small_data_ + (size_++)) T(std::move(*it)); in SmallVector()
99 for (T* p = small_data_; p < small_data_ + size_; ++p) { in ~SmallVector()
116 for (; i < size_ && i < that.size_; ++i) { in operator =()
120 if (i >= that.size_) { in operator =()
464 size_t size_; global() member in spvtools::utils::SmallVector
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/util/
H A Dsmall_vector.h48 : size_(0), in SmallVector()
60 size_ = vec.size(); in SmallVector()
61 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
71 size_ = vec.size(); in SmallVector()
72 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
82 new (small_data_ + (size_++)) T(std::move(*it)); in SmallVector()
92 for (T* p = small_data_; p < small_data_ + size_; ++p) { in ~SmallVector()
109 for (; i < size_ && i < that.size_; ++i) { in operator =()
113 if (i >= that.size_) { in operator =()
445 size_t size_; global() member in spvtools::utils::SmallVector
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/util/
H A Dsmall_vector.h48 : size_(0), in SmallVector()
60 size_ = vec.size(); in SmallVector()
61 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
71 size_ = vec.size(); in SmallVector()
72 for (uint32_t i = 0; i < size_; i++) { in SmallVector()
82 new (small_data_ + (size_++)) T(std::move(*it)); in SmallVector()
92 for (T* p = small_data_; p < small_data_ + size_; ++p) { in ~SmallVector()
109 for (; i < size_ && i < that.size_; ++i) { in operator =()
113 if (i >= that.size_) { in operator =()
445 size_t size_; global() member in spvtools::utils::SmallVector
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcharconv_bigint.h62 BigUnsigned() : size_(0), words_{} {} in BigUnsigned()
64 : size_((v >> 32) ? 2 : v ? 1 : 0), in BigUnsigned()
71 explicit BigUnsigned(absl::string_view sv) : size_(0), words_{} { in BigUnsigned()
109 size_ = (std::min)(size_ + word_shift, max_words); in ShiftLeft()
112 std::copy_backward(words_, words_ + size_ - word_shift, words_ + size_); in ShiftLeft()
114 for (int i = (std::min)(size_, max_words - 1); i > word_shift; --i) { in ShiftLeft()
119 // Grow size_ if necessary. in ShiftLeft()
120 if (size_ < max_word in ShiftLeft()
345 int size_; global() member in absl::strings_internal::BigUnsigned
[all...]
/third_party/node/deps/v8/src/codegen/
H A Daligned-slot-allocator.cc71 size_ = std::max(size_, result + n); in Allocate()
81 // Reserve |n| slots at |size_|, invalidate fragments below the new |size_|, in AllocateUnaligned()
82 // and add any new fragments beyond the new |size_|. in AllocateUnaligned()
83 int result = size_; in AllocateUnaligned()
84 size_ += n; in AllocateUnaligned()
85 switch (size_ & 3) { in AllocateUnaligned()
88 next4_ = size_; in AllocateUnaligned()
92 next1_ = size_; in AllocateUnaligned()
[all...]
/third_party/node/deps/v8/src/utils/
H A Ddetachable-vector.h25 size_ = 0; in detach()
28 void pop_back() { --size_; } in pop_back()
30 size_t size() const { return size_; } in size()
31 bool empty() const { return size_ == 0; } in empty()
41 size_t size_ = 0; member in v8::internal::DetachableVectorBase
56 if (size_ == capacity_) { in push_back()
61 data()[size_] = value; in push_back()
62 ++size_; in push_back()
70 size_ = 0; in free()
74 DCHECK_LT(i, size_); in at()
[all...]
/third_party/protobuf/src/google/protobuf/stubs/
H A Dbytestream.cc69 : outbuf_(outbuf), capacity_(capacity), size_(0), overflowed_(false) { in CheckedArrayByteSink()
73 size_t available = capacity_ - size_; in Append()
78 if (n > 0 && bytes != (outbuf_ + size_)) { in Append()
82 memcpy(outbuf_ + size_, bytes, n); in Append()
84 size_ += n; in Append()
90 size_(0) { in GrowingArrayByteSink()
98 size_t available = capacity_ - size_; in Append()
99 if (bytes != (buf_ + size_)) { in Append()
108 if (n > 0 && bytes != (buf_ + size_)) { in Append()
109 memcpy(buf_ + size_, byte in Append()
[all...]
H A Dsubstitute.h92 : text_(value), size_(strlen(text_)) {} in SubstituteArg()
94 : text_(value.data()), size_(value.size()) {} in SubstituteArg()
98 : text_(nullptr), size_(-1) {} in SubstituteArg()
107 : text_(scratch_), size_(1) { scratch_[0] = value; } in SubstituteArg()
109 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
111 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
113 : text_(FastInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
115 : text_(FastUInt32ToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
117 : text_(FastLongToBuffer(value, scratch_)), size_(strlen(text_)) {} in SubstituteArg()
119 : text_(FastULongToBuffer(value, scratch_)), size_(strle in SubstituteArg()
136 int size_; global() member in google::protobuf::strings::internal::SubstituteArg
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dvalue-numbering-reducer.cc20 size_(0), in ValueNumberingReducer()
32 DCHECK_EQ(0, size_); in Reduce()
39 size_ = 1; in Reduce()
43 DCHECK(size_ < capacity_); in Reduce()
44 DCHECK(size_ + size_ / 4 < capacity_); in Reduce()
58 size_++; in Reduce()
61 if (size_ + size_ / 4 >= capacity_) Grow(); in Reduce()
63 DCHECK(size_ in Reduce()
[all...]
/third_party/node/deps/v8/src/base/
H A Daddress-region.h31 : address_(address), size_(size) {} in AddressRegion()
34 Address end() const { return address_ + size_; } in end()
36 size_t size() const { return size_; } in size()
37 void set_size(size_t size) { size_ = size; } in set_size()
39 bool is_empty() const { return size_ == 0; } in is_empty()
49 return (offset < size_) && (offset + size <= size_); in contains()
53 return contains(region.address_, region.size_); in contains()
64 return address_ == other.address_ && size_ == other.size_; in operator ==()
73 size_t size_ = 0; global() member in v8::base::AddressRegion
[all...]
/third_party/node/deps/v8/src/heap/
H A Dallocation-stats.h30 size_.store(stats.size_);
45 size_ = 0; in ClearSize()
54 size_t Size() const { return size_; } in Size()
63 size_t size = size_; in IncreaseAllocatedBytes()
66 size_.fetch_add(bytes); in IncreaseAllocatedBytes()
73 DCHECK_GE(size_, bytes); in DecreaseAllocatedBytes()
74 size_.fetch_sub(bytes); in DecreaseAllocatedBytes()
83 DCHECK_GE(capacity_ - bytes, size_); in DecreaseCapacity()
105 // |size_|
106 std::atomic<size_t> size_; global() member in v8::internal::AllocationStats
[all...]
/third_party/googletest/googletest/samples/
H A Dsample3-inl.h75 Queue() : head_(nullptr), last_(nullptr), size_(0) {} in Queue()
82 if (size_ > 0) { in Clear()
95 size_ = 0; in Clear()
100 size_t Size() const { return size_; } in Size()
117 if (size_ == 0) { in Enqueue()
119 size_ = 1; in Enqueue()
123 size_++; in Enqueue()
130 if (size_ == 0) { in Dequeue()
136 size_--; in Dequeue()
137 if (size_ in Dequeue()
164 size_t size_; // The number of elements in the queue. global() member in Queue
[all...]
/third_party/icu/icu4c/source/common/
H A Dbytestream.cpp33 size_(0), appended_(0), overflowed_(false) { in CheckedArrayByteSink()
39 size_ = appended_ = 0; in Reset()
55 int32_t available = capacity_ - size_; in Append()
60 if (n > 0 && bytes != (outbuf_ + size_)) { in Append()
61 uprv_memcpy(outbuf_ + size_, bytes, n); in Append()
63 size_ += n; in Append()
75 int32_t available = capacity_ - size_; in GetAppendBuffer()
78 return outbuf_ + size_; in GetAppendBuffer()
/third_party/node/deps/icu-small/source/common/
H A Dbytestream.cpp33 size_(0), appended_(0), overflowed_(false) { in CheckedArrayByteSink()
39 size_ = appended_ = 0; in Reset()
55 int32_t available = capacity_ - size_; in Append()
60 if (n > 0 && bytes != (outbuf_ + size_)) { in Append()
61 uprv_memcpy(outbuf_ + size_, bytes, n); in Append()
63 size_ += n; in Append()
75 int32_t available = capacity_ - size_; in GetAppendBuffer()
78 return outbuf_ + size_; in GetAppendBuffer()
/third_party/skia/third_party/externals/icu/source/common/
H A Dbytestream.cpp33 size_(0), appended_(0), overflowed_(FALSE) { in CheckedArrayByteSink()
39 size_ = appended_ = 0; in Reset()
55 int32_t available = capacity_ - size_; in Append()
60 if (n > 0 && bytes != (outbuf_ + size_)) { in Append()
61 uprv_memcpy(outbuf_ + size_, bytes, n); in Append()
63 size_ += n; in Append()
75 int32_t available = capacity_ - size_; in GetAppendBuffer()
78 return outbuf_ + size_; in GetAppendBuffer()
/third_party/node/deps/brotli/c/enc/
H A Dringbuffer.h34 const uint32_t size_; member
60 *(uint32_t*)&rb->size_ = 1u << window_bits; in RingBufferSetup()
63 *(uint32_t*)&rb->total_size_ = rb->size_ + rb->tail_size_; in RingBufferSetup()
98 const size_t p = rb->size_ + masked_pos; in RingBufferWriteTail()
126 rb->buffer_[rb->size_ - 2] = 0; in RingBufferWrite()
127 rb->buffer_[rb->size_ - 1] = 0; in RingBufferWrite()
130 rb->buffer_[rb->size_] = 241; in RingBufferWrite()
137 if (BROTLI_PREDICT_TRUE(masked_pos + n <= rb->size_)) { in RingBufferWrite()
146 memcpy(&rb->buffer_[0], bytes + (rb->size_ - masked_pos), in RingBufferWrite()
147 n - (rb->size_ in RingBufferWrite()
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dringbuffer.h34 const uint32_t size_; member
60 *(uint32_t*)&rb->size_ = 1u << window_bits; in RingBufferSetup()
63 *(uint32_t*)&rb->total_size_ = rb->size_ + rb->tail_size_; in RingBufferSetup()
98 const size_t p = rb->size_ + masked_pos; in RingBufferWriteTail()
126 rb->buffer_[rb->size_ - 2] = 0; in RingBufferWrite()
127 rb->buffer_[rb->size_ - 1] = 0; in RingBufferWrite()
130 rb->buffer_[rb->size_] = 241; in RingBufferWrite()
137 if (BROTLI_PREDICT_TRUE(masked_pos + n <= rb->size_)) { in RingBufferWrite()
146 memcpy(&rb->buffer_[0], bytes + (rb->size_ - masked_pos), in RingBufferWrite()
147 n - (rb->size_ in RingBufferWrite()
[all...]
/third_party/gn/src/gn/
H A Dhash_table_base.h209 : count_(other.count_), size_(other.size_) { in HashTableBase()
213 buckets_ = reinterpret_cast<Node*>(malloc(other.size_ * sizeof(Node))); in HashTableBase()
215 memcpy(buckets_, other.buckets_, other.size_ * sizeof(Node)); in HashTableBase()
227 : count_(other.count_), size_(other.size_), buckets_(other.buckets_) { in buckets_()
388 Node* limit = node + size_; in NodeBegin()
396 Node* limit = buckets_ + size_; in NodeEnd()
435 size_ = 1; in NodeClear()
456 size_t mask = size_ in NodeLookup()
536 size_t size_ = 1; global() member in HashTableBase
[all...]
/third_party/node/deps/v8/src/wasm/
H A Dstacks.h50 if (owned_) allocator->DecommitPages(limit_, size_); in ~StackMemory()
60 Address base() const { return reinterpret_cast<Address>(limit_ + size_); } in base()
75 size_t owned_size() { return sizeof(StackMemory) + (owned_ ? size_ : 0); } in owned_size()
78 return limit_ < sp && sp <= limit_ + size_; in IsActive()
94 size_ = (kJsStackSizeKB + kJSLimitOffsetKB) * KB; in StackMemory()
95 size_ = RoundUp(size_, allocator->AllocatePageSize()); in StackMemory()
97 allocator->AllocatePages(nullptr, size_, allocator->AllocatePageSize(), in StackMemory()
108 size_(reinterpret_cast<size_t>(limit)), in StackMemory()
115 size_t size_; member in v8::internal::wasm::StackMemory
[all...]
/third_party/libphonenumber/cpp/src/phonenumbers/utf/
H A Dunicodetext.cc119 memcpy(new_data, data_, size_); in reserve()
124 // size_ is unchanged. in reserve()
133 if (size_ < new_size) memset(data_ + size_, 0, new_size - size_); in resize()
134 size_ = new_size; in resize()
140 // That's not strictly necessary; we could just set size_ to 0.
144 size_ = capacity_ = 0; in clear()
157 size_ = size; in TakeOwnershipOf()
165 size_ in PointTo()
[all...]
/third_party/node/deps/v8/src/heap/cppgc/
H A Dvirtual-memory.cc24 size_ = RoundUp(size, page_size); in VirtualMemory()
30 page_allocator_->FreePages(start_, size_);
37 size_(std::move(other.size_)) { in move()
45 size_ = std::move(other.size_);
52 size_ = 0; in Reset()
/third_party/vixl/examples/aarch64/
H A Dexecutable-memory.h49 : size_(size), in ExecutableMemory()
57 memcpy(buffer_, code_start, size_); in ExecutableMemory()
59 vixl::aarch64::CPU::EnsureIAndDCacheCoherency(buffer_, size_); in ExecutableMemory()
60 int res = mprotect(buffer_, size_, PROT_READ | PROT_EXEC); in ExecutableMemory()
63 ~ExecutableMemory() { munmap(buffer_, size_); } in ~ExecutableMemory()
74 VIXL_ASSERT((offset >= 0) && (static_cast<size_t>(offset) <= size_)); in GetOffsetAddress()
83 size_t size_; member in ExecutableMemory
/third_party/node/deps/v8/src/debug/wasm/gdb-server/
H A Dtransport.cc110 size_(0), in Transport()
121 int32_t copy_bytes = std::min(*len, size_ - pos_); in CopyFromBuffer()
129 if (pos_ < size_) { in Read()
134 size_ = 0; in Read()
163 if (pos_ < size_) { in IsDataAvailable()
261 ::recv(handle_accept_, buf_.get() + size_, kBufSize - size_, 0); in ReadSomeData()
263 size_ += result; in ReadSomeData()
293 bool wait = !(pos_ < size_); in WaitForDebugStubEvent()
298 int count = size_ < kBufSiz in WaitForDebugStubEvent()
[all...]
/third_party/node/deps/v8/third_party/inspector_protocol/crdtp/
H A Dspan.h25 constexpr span() : data_(nullptr), size_(0) {} in span()
26 constexpr span(const T* data, index_type size) : data_(data), size_(size) {} in span()
31 constexpr const T* end() const { return data_ + size_; } in end()
40 return span(data_ + offset, size_ - offset); in subspan()
43 constexpr bool empty() const { return size_ == 0; } in empty()
45 constexpr index_type size() const { return size_; } in size()
46 constexpr index_type size_bytes() const { return size_ * sizeof(T); } in size_bytes()
50 index_type size_; member in v8_crdtp::span
/third_party/vixl/examples/aarch32/
H A Dexamples.h48 : size_(size), in ExecutableMemory()
56 memcpy(buffer_, code_start, size_); in ExecutableMemory()
57 __builtin___clear_cache(buffer_, buffer_ + size_); in ExecutableMemory()
59 ~ExecutableMemory() { munmap(buffer_, size_); } in ~ExecutableMemory()
71 VIXL_ASSERT((offset >= 0) && (static_cast<size_t>(offset) <= size_)); in GetOffsetAddress()
79 size_t size_; member in ExecutableMemory

Completed in 10 milliseconds

12345678910