| /llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/ |
| H A D | tsan_mutexset.cpp | 32 if (size_ == kMaxSize) { in Add()
45 descs_[size_].addr = 0; in Add()
47 descs_[size_].id = id; in Add()
51 descs_[size_].count = 1; in Add()
52 size_++; in Add()
96 descs_[size_].id = 0; in AddAddr()
101 size_++; in AddAddr()
115 CHECK_LT(i, size_); in RemovePos()
117 size_--; in RemovePos()
121 return size_; in Size()
[all …]
|
| H A D | tsan_clock.cpp | 417 if (size_) in Reset()
425 size_ = 0; in ResetImpl()
436 size_ = nclk; in Resize()
439 if (size_ == 0) { in Resize()
449 size_ = 1; in Resize()
470 size_ = nclk; in Resize()
486 if (size_ == 0) in IsShared()
504 old.size_ = size_; in Unshare()
530 if (size_ == 0) in Cachable()
555 if (size_ == 0) in capacity()
[all …]
|
| H A D | tsan_ignoreset.cpp | 19 : size_() { in IgnoreSet()
23 if (size_ == kMaxSize) in Add()
25 for (uptr i = 0; i < size_; i++) { in Add()
29 stacks_[size_++] = stack_id; in Add()
33 CHECK_LT(i, size_); in At()
34 CHECK_LE(size_, kMaxSize); in At()
|
| H A D | tsan_ilist.h | 66 uptr size_ = 0; variable
101 size_++; in Push()
111 DCHECK(size_); in Remove()
115 size_--; in Remove()
136 return size_ ? ToElem(node_.next_) : nullptr; in Front()
141 return size_ ? ToElem(node_.prev_) : nullptr; in Back()
160 return size_; in Size()
165 return size_ == 0; in Empty()
|
| H A D | tsan_ignoreset.h | 24 void Reset() { size_ = 0; } in Reset()
25 uptr Size() const { return size_; } in Size()
30 uptr size_; variable
|
| /llvm-project-15.0.7/flang/include/flang/Common/ |
| H A D | interval.h | 36 (start_ == that.start_ && size_ < that.size_);
40 (start_ == that.start_ && size_ <= that.size_);
43 return start_ == that.start_ && size_ == that.size_;
72 size_ = (that.start_ + that.size_) - start_; in Annex()
76 size_ += that.size_; in AnnexIfPredecessor()
82 if (size_ == 0) { in ExtendToCover()
87 size_ = end - start_; in ExtendToCover()
96 CHECK(n <= size_); in OffsetMember()
115 return {start_, std::min(size_, that.size_ - skip)}; in Intersection()
120 return {that.start_, std::min(that.size_, size_ - skip)}; in Intersection()
[all …]
|
| H A D | fast-int-set.h | 36 int size() const { return size_; } in size()
41 void Clear() { size_ = 0; } in Clear()
43 bool IsEmpty() const { return size_ == 0; } in IsEmpty()
47 for (int j{size_}; j < N; ++j) { in InitializeState()
57 return j >= 0 && j < size_ && value_[j] == n; in Contains()
66 value_[index_[n] = size_++] = n; in Add()
77 int last{value_[--size_]}; in Remove()
90 return value_[--size_]; in PopValue()
97 return j >= 0 && j < size_ && value_[j] == n; in UncheckedContains()
102 int size_{0};
|
| /llvm-project-15.0.7/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_mutexset.cpp | 34 if (size_ == kMaxSize) { in AddAddr()
44 descs_[size_].addr = addr; in AddAddr()
46 descs_[size_].write = write; in AddAddr()
47 descs_[size_].seq = seq_++; in AddAddr()
48 descs_[size_].count = 1; in AddAddr()
49 size_++; in AddAddr()
63 CHECK_LT(i, size_); in RemovePos()
64 descs_[i] = descs_[size_ - 1]; in RemovePos()
65 size_--; in RemovePos()
69 return size_; in Size()
[all …]
|
| H A D | tsan_ignoreset.cpp | 19 : size_() { in IgnoreSet()
23 if (size_ == kMaxSize) in Add()
25 for (uptr i = 0; i < size_; i++) { in Add()
29 stacks_[size_++] = stack_id; in Add()
33 CHECK_LT(i, size_); in At()
34 CHECK_LE(size_, kMaxSize); in At()
|
| H A D | tsan_ilist.h | 66 uptr size_ = 0; variable
101 size_++; in Push()
111 DCHECK(size_); in Remove()
115 size_--; in Remove()
136 return size_ ? ToElem(node_.next_) : nullptr; in Front()
141 return size_ ? ToElem(node_.prev_) : nullptr; in Back()
160 return size_; in Size()
165 return size_ == 0; in Empty()
|
| H A D | tsan_ignoreset.h | 24 void Reset() { size_ = 0; } in Reset()
25 uptr Size() const { return size_; } in Size()
30 uptr size_; variable
|
| /llvm-project-15.0.7/libcxx/test/support/ |
| H A D | test_constexpr_container.h | 25 int size_ = 0; variable
33 constexpr iterator end() { return data_ + size_; } in end()
35 constexpr const_iterator end() const { return data_ + size_; } in end()
36 constexpr size_t size() const { return size_; } in size()
37 constexpr const T& front() const { assert(size_ >= 1); return data_[0]; } in front()
38 constexpr const T& back() const { assert(size_ >= 1); return data_[size_-1]; } in back()
42 if (i != size_) { in insert()
43 std::move_backward(data_ + i, data_ + size_, data_ + size_ + 1); in insert()
46 size_ += 1; in insert()
|
| /llvm-project-15.0.7/flang/runtime/ |
| H A D | buffer.h | 84 RUNTIME_CHECK(handler, next < size_); in ReadFrame()
86 auto maxBytes{size_ - next}; in ReadFrame()
90 RUNTIME_CHECK(handler, length_ <= size_); in ReadFrame()
144 if (bytes > size_) { in Reallocate()
146 auto oldSize{size_}; in Reallocate()
147 size_ = std::max<std::int64_t>(bytes, size_ + minBuffer); in Reallocate()
171 if (start_ >= size_) { in DiscardLeadingBytes()
172 start_ -= size_; in DiscardLeadingBytes()
187 RUNTIME_CHECK(handler, length_ < size_); in MakeDataContiguous()
188 if (start_ + length_ <= size_) { in MakeDataContiguous()
[all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_list.h | 33 size_ = 0; in clear()
43 size_ = 1; in push_back()
48 size_++; in push_back()
56 size_ = 1; in push_front()
60 size_++; in push_front()
69 size_--; in pop_front()
80 size_--; in extract()
97 size_ += l->size(); in append_front()
111 size_ += l->size(); in append_back()
117 if (size_ == 0) { in CheckConsistency()
[all …]
|
| H A D | sanitizer_common.h | 193 uptr size_; variable
505 size_ = 0; in Initialize()
511 CHECK_LT(i, size_);
515 CHECK_LT(i, size_);
527 CHECK_GT(size_, 0); in back()
532 size_--; in pop_back()
535 return size_; in size()
552 internal_memset(&data_[size_], 0, sizeof(T) * (new_size - size_)); in resize()
554 size_ = new_size; in resize()
576 Swap(size_, other.size_); in swap()
[all …]
|
| H A D | sanitizer_quarantine.h | 208 : size_() { in QuarantineCache()
214 return atomic_load_relaxed(&size_); in Size()
238 atomic_store_relaxed(&from_cache->size_, 0); in Transfer()
306 atomic_uintptr_t size_; variable
309 atomic_store_relaxed(&size_, Size() + add); in SizeAdd()
312 atomic_store_relaxed(&size_, Size() - sub); in SizeSub()
|
| H A D | sanitizer_posix_libcdep.cpp | 340 size_ = size; in Init()
359 CHECK_LE(size, size_); in Unmap()
362 base_ = (size == size_) ? nullptr : reinterpret_cast<void*>(addr + size); in Unmap()
364 CHECK_EQ(addr + size, reinterpret_cast<uptr>(base_) + size_); in Unmap()
365 size_ -= size; in Unmap()
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.zip/ |
| H A D | size.pass.cpp | 26 std::size_t size_ = 0; member
27 constexpr View(std::size_t s) : size_(s) {} in View()
29 constexpr auto end() const { return buffer + size_; } in end()
34 std::size_t size_ = 0; member
35 constexpr SizedNonConst(std::size_t s) : size_(s) {} in SizedNonConst()
37 constexpr auto end() const { return iterator{buffer + size_}; } in end()
38 constexpr std::size_t size() { return size_; } in size()
|
| H A D | types.h | 26 std::size_t size_; member
29 constexpr BufferView(T (&b)[N]) : buffer_(b), size_(N) {} in BufferView()
47 return buffer_ + size_; in end()
75 return iterator(buffer_ + size_); in end()
99 return sentinel_wrapper<int*>(buffer_ + size_); in end()
123 return sentinel_wrapper<int*>(buffer_ + size_); in end()
126 constexpr std::size_t size() const { return size_; } in size()
183 return NonConstIter(buffer_ + size_); in end()
185 return NonConstSent(NonConstIter(buffer_ + size_)); in end()
191 return Iter(buffer_ + size_); in end()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.join.view/ |
| H A D | types.h | 56 unsigned size_; member
66 : ptr_(ptr), size_(size) {} in ptr_()
74 constexpr sentinel end() { return sentinel(iterator(ptr_ + size_)); } in end()
80 unsigned size_; member
166 std::size_t size_; member
169 constexpr BufferView(T (&b)[N]) : data_(b), size_(N) {} in BufferView()
170 constexpr BufferView(T* p, std::size_t s) : data_(p), size_(s) {} in BufferView()
181 return NonConstIter(this->data_ + this->size_); in end()
183 return NonConstSent(NonConstIter(this->data_ + this->size_)); in end()
189 return Iter(this->data_ + this->size_); in end()
[all …]
|
| /llvm-project-15.0.7/compiler-rt/lib/asan/ |
| H A D | asan_errors.h | 159 uptr size_) in ErrorCallocOverflow()
163 size(size_) {} in ErrorCallocOverflow()
174 uptr size_) in ErrorReallocArrayOverflow()
178 size(size_) {} in ErrorReallocArrayOverflow()
187 ErrorPvallocOverflow(u32 tid, BufferedStackTrace *stack_, uptr size_) in ErrorPvallocOverflow()
190 size(size_) {} in ErrorPvallocOverflow()
214 uptr size_, uptr alignment_) in ErrorInvalidAlignedAllocAlignment()
217 size(size_), in ErrorInvalidAlignedAllocAlignment()
307 uptr addr, uptr size_) in ErrorStringFunctionSizeOverflow()
311 size(size_) {} in ErrorStringFunctionSizeOverflow()
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.reverse/ |
| H A D | size.pass.cpp | 27 size_t size_; member
29 constexpr BidirSizedRange(int *ptr, size_t size) : ptr_(ptr), size_(size) {} in BidirSizedRange()
40 constexpr size_t size() const { return size_; } in size()
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.access/ |
| H A D | empty.pass.cpp | 91 size_t size_; member
92 constexpr size_t size() const { return size_; } in size()
96 size_t size_; member
97 friend constexpr size_t size(SizeFunction sf) { return sf.size_; } in size()
|
| /llvm-project-15.0.7/flang/include/flang/Evaluate/ |
| H A D | fold-designator.h | 42 : symbol_{symbol}, size_{bytes} {} in OffsetSymbol()
49 std::size_t size() const { return size_; } in size()
50 void set_size(std::size_t bytes) { size_ = bytes; } in set_size()
55 std::size_t size_; variable
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/ |
| H A D | sortable_helpers.h | 111 size_t size_; member
119 constexpr NonBorrowedRange(int* d, size_t s) : data_{d}, size_{s} {} in NonBorrowedRange()
122 constexpr Sent end() const { return Sent{Iter{data_ + size_}}; }; in end()
|