| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_allocator_local_cache.h | 56 if (UNLIKELY(c->count == c->max_count)) in Deallocate()
80 u32 max_count; member
88 if (LIKELY(c->max_count)) in InitCache()
96 DCHECK_NE(c->max_count, 0UL); in InitCache()
102 const uptr num_requested_chunks = c->max_count / 2; in Refill()
181 if (UNLIKELY(c->count == c->max_count)) in Deallocate()
208 uptr max_count; member
217 if (LIKELY(c->max_count)) in InitCache()
224 c->max_count = 2 * max_cached; in InitCache()
238 DCHECK_NE(c->max_count, 0UL); in InitCache()
[all …]
|
| H A D | sanitizer_allocator_primary32.h | 317 TransferBatch **current_batch, uptr max_count, in PopulateBatches() argument
332 if (b->Count() == max_count) { in PopulateBatches()
352 const uptr max_count = TransferBatch::MaxCached(size); in PopulateFreeList() local
353 DCHECK_GT(max_count, 0); in PopulateFreeList()
361 if (UNLIKELY(!PopulateBatches(c, sci, class_id, &b, max_count, in PopulateFreeList()
368 if (UNLIKELY(!PopulateBatches(c, sci, class_id, &b, max_count, in PopulateFreeList()
|
| /llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/bugprone/ |
| H A D | infinite-loop.mm | 51 NSUInteger max_count = 10;
52 while ([arr count] < max_count) {
68 NSUInteger max_count = 10;
69 while (arr.count < max_count) {
95 NSUInteger max_count = 10;
96 while (_count < max_count) {
112 NSUInteger max_count = 10;
113 while (arr->_count < max_count) {
|
| /llvm-project-15.0.7/lldb/test/API/functionalities/data-formatter/data-formatter-synthtype/ |
| H A D | myIntSynthProvider.py | 32 def num_children(self, max_count): argument
33 if 16 < max_count:
35 return max_count
|
| /llvm-project-15.0.7/lldb/test/API/functionalities/data-formatter/data-formatter-synthval/ |
| H A D | myIntSynthProvider.py | 32 def num_children(self, max_count): argument
33 if 16 < max_count:
35 return max_count
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| H A D | default.pred.pass.cpp | 53 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
57 assert(count_equal::count <= max_count); in do_search()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| H A D | make_default_searcher.pred.pass.cpp | 38 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
42 assert(count_equal::count <= max_count); in do_search()
|
| /llvm-project-15.0.7/lldb/examples/synthetic/ |
| H A D | libcxx.py | 418 if steps > self.max_count:
446 if steps > self.max_count:
452 def __init__(self, node, max_count=0): argument
456 self.max_count = max_count
581 self.root_node, max_count=self.num_children())
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| H A D | pred.pass.cpp | 52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
57 assert(count_equal::count <= max_count); in do_search()
|
| H A D | hash.pred.pass.cpp | 56 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
63 assert(count_equal::count <= max_count); in do_search()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| H A D | hash.pred.pass.cpp | 55 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
62 assert(count_equal::count <= max_count); in do_search()
|
| H A D | pred.pass.cpp | 51 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
56 assert(count_equal::count <= max_count); in do_search()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| H A D | hash.pred.pass.cpp | 56 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
63 assert(count_equal::count <= max_count); in do_search()
|
| H A D | pred.pass.cpp | 52 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
57 assert(count_equal::count <= max_count); in do_search()
|
| /llvm-project-15.0.7/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| H A D | pred.pass.cpp | 53 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
58 assert(count_equal::count <= max_count); in do_search()
|
| H A D | hash.pred.pass.cpp | 57 void do_search(Iter1 b1, Iter1 e1, Iter2 b2, Iter2 e2, Iter1 result, unsigned max_count) { in do_search() argument
64 assert(count_equal::count <= max_count); in do_search()
|
| /llvm-project-15.0.7/llvm/utils/unittest/googletest/src/ |
| H A D | gtest-port.cc | 887 const size_t max_count = (repeat == '?') ? 1 : in MatchRepetitionAndRegexAtHead() local
892 for (size_t i = 0; i <= max_count; ++i) { in MatchRepetitionAndRegexAtHead()
|
| /llvm-project-15.0.7/openmp/runtime/src/ |
| H A D | kmp_affinity.cpp | 968 int max_count; in filter_hw_subset() local
996 max_count = get_ratio(level); in filter_hw_subset()
997 if (max_count < 0 || in filter_hw_subset()
998 (num != kmp_hw_subset_t::USE_ALL && num + offset > max_count)) { in filter_hw_subset()
1068 max_count = get_ncores_with_attr_per(item.attr[j], level_above); in filter_hw_subset()
1069 if (max_count <= 0 || in filter_hw_subset()
1070 (num != kmp_hw_subset_t::USE_ALL && num + offset > max_count)) { in filter_hw_subset()
|
| /llvm-project-15.0.7/lldb/examples/python/ |
| H A D | mach_o.py | 1089 dump_memory(0, sect_bytes, options.max_count, 16)
|