Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 409) sorted by relevance

12345678910>>...17

/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dpr29160.cpp18 #define STAMP(thiz, prev) using thiz = Foo< \ argument
19 prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, \
20 prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, \
21 prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev \
/llvm-project-15.0.7/lld/MachO/
H A DMarkLive.cpp27 const WhyLiveEntry *prev; member
30 : isec(isec), prev(prev) {} in WhyLiveEntry()
82 worklist.push_back(makeEntry(s, prev)); in enqueue()
93 printWhyLive(s, prev); in addSym()
96 enqueue(d->isec, d->value, prev); in addSym()
98 enqueue(d->unwindEntry, 0, prev); in addSym()
105 for (const WhyLiveEntry *entry = prev; entry; in printWhyLiveImpl()
106 entry = entry->prev, indent += 2) { in printWhyLiveImpl()
123 printWhyLiveImpl(s, prev); in printWhyLive()
145 assert(!prev); in makeEntry()
[all …]
/llvm-project-15.0.7/compiler-rt/test/sanitizer_common/TestCases/Posix/
H A Dreplace_sigaction.cpp14 template <typename T> void install(T *handler, struct sigaction *prev) { in install() argument
23 int ret = sigaction(SIGHUP, &act, prev); in install()
41 struct sigaction prev = {}; in test() local
42 install(to, &prev); in test()
46 assert(prev.sa_flags & SA_SIGINFO); in test()
47 assert(prev.sa_sigaction == (decltype(prev.sa_sigaction))from); in test()
49 assert((prev.sa_flags & SA_SIGINFO) == 0); in test()
50 assert(prev.sa_handler == (decltype(prev.sa_handler))from); in test()
/llvm-project-15.0.7/mlir/lib/Support/
H A DToolUtilities.cpp53 StringRef prev; in splitAndProcessBuffer() local
55 if (prev.empty()) { in splitAndProcessBuffer()
56 prev = buffer; in splitAndProcessBuffer()
64 sourceBuffers.push_back(prev); in splitAndProcessBuffer()
65 prev = buffer.drop_front(checkLen); in splitAndProcessBuffer()
72 prev = StringRef(prev.data(), in splitAndProcessBuffer()
73 prev.size() + splitMarkerLen - checkLen + buffer.size()); in splitAndProcessBuffer()
76 if (!prev.empty()) in splitAndProcessBuffer()
77 sourceBuffers.push_back(prev); in splitAndProcessBuffer()
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_atomic_msvc.h179 u8 prev; in atomic_compare_exchange_strong() local
185 mov prev, al in atomic_compare_exchange_strong()
188 if (prev == cmpv) in atomic_compare_exchange_strong()
190 *cmp = prev; in atomic_compare_exchange_strong()
201 if (prev == cmpv) in atomic_compare_exchange_strong()
203 *cmp = prev; in atomic_compare_exchange_strong()
214 if (prev == cmpv) in atomic_compare_exchange_strong()
216 *cmp = prev; in atomic_compare_exchange_strong()
227 if (prev == cmpv) in atomic_compare_exchange_strong()
229 *cmp = prev; in atomic_compare_exchange_strong()
[all …]
/llvm-project-15.0.7/libcxxabi/src/
H A Dfallback_malloc.cpp101 heap_node *p, *prev; in fallback_malloc() local
109 for (p = freelist, prev = 0; p && p != list_end; in fallback_malloc()
110 prev = p, p = node_from_offset(p->next_node)) { in fallback_malloc()
123 if (prev == 0) in fallback_malloc()
126 prev->next_node = p->next_node; in fallback_malloc()
139 struct heap_node *p, *prev; in fallback_free() local
147 for (p = freelist, prev = 0; p && p != list_end; in fallback_free()
166 if (prev == 0) { in fallback_free()
170 prev->next_node = offset_from_node(cp); in fallback_free()
184 struct heap_node *p, *prev; in print_free_list() local
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/iterators/
H A Dassert.prev.pass.cpp27 std::prev(bidi, -1); // should work fine in main()
28 std::prev(bidi, 0); // should work fine in main()
29 std::prev(bidi, 1); // should work fine in main()
32 std::prev(it, -1); // should work fine in main()
33 std::prev(it, 0); // should work fine in main()
34 …TEST_LIBCPP_ASSERT_FAILURE(std::prev(it, 1), "Attempt to prev(it, n) with a positive n on a non-bi… in main()
/llvm-project-15.0.7/lldb/source/Plugins/Trace/intel-pt/
H A DPerfContextSwitchDecoder.cpp206 const ContextSwitchRecord &prev = *prev_record; in RecoverExecutionsFromConsecutiveRecords() local
207 if (prev.tsc >= current_record.tsc) in RecoverExecutionsFromConsecutiveRecords()
212 prev.tsc, current_record.tsc)); in RecoverExecutionsFromConsecutiveRecords()
214 if (current_record.IsIn() && prev.IsIn()) { in RecoverExecutionsFromConsecutiveRecords()
218 cpu_id, prev.tid, prev.pid, prev.tsc, current_record.tsc - 1)); in RecoverExecutionsFromConsecutiveRecords()
219 } else if (current_record.IsOut() && prev.IsOut()) { in RecoverExecutionsFromConsecutiveRecords()
223 cpu_id, current_record.tid, current_record.pid, prev.tsc + 1, in RecoverExecutionsFromConsecutiveRecords()
225 } else if (current_record.IsOut() && prev.IsIn()) { in RecoverExecutionsFromConsecutiveRecords()
226 if (current_record.pid == prev.pid && current_record.tid == prev.tid) { in RecoverExecutionsFromConsecutiveRecords()
229 cpu_id, current_record.tid, current_record.pid, prev.tsc, in RecoverExecutionsFromConsecutiveRecords()
[all …]
/llvm-project-15.0.7/cross-project-tests/debuginfo-tests/llvm-prettyprinters/gdb/
H A Dllvm-support.gdb62 # CHECK: prev = [[Ilist_Sentinel:0x.*]] <Ilist>,
66 # CHECK: prev = [[Node_14]],
74 # CHECK: prev = [[Node_13:0x.*]],
78 # CHECK: prev = [[Node_15]],
86 # CHECK: prev = [[Node_14]],
90 # CHECK: prev = [[SimpleIlist_Sentinel]] <SimpleIlist>,
102 # CHECK: prev = [[Node_14]],
114 # CHECK: prev = [[Node_13]],
118 # CHECK: prev = [[Node_15]],
126 # CHECK: prev = [[Ilist_Sentinel]] <Ilist>,
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/
H A Dprev_permutation.pass.cpp39 int prev[sa]; in test() local
46 std::copy(ia, ia+e, prev); in test()
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); in test()
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); in test()
H A Dnext_permutation.pass.cpp39 int prev[sa]; in test() local
46 std::copy(ia, ia+e, prev); in test()
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); in test()
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); in test()
H A Dprev_permutation_comp.pass.cpp41 int prev[sa]; in test() local
48 std::copy(ia, ia+e, prev); in test()
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); in test()
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); in test()
H A Dnext_permutation_comp.pass.cpp41 int prev[sa]; in test() local
48 std::copy(ia, ia+e, prev); in test()
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); in test()
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); in test()
/llvm-project-15.0.7/compiler-rt/lib/dfsan/
H A Ddfsan_origin.h73 static Origin CreateChainedOrigin(Origin prev, StackTrace *stack) { in CreateChainedOrigin() argument
74 int depth = prev.isChainedOrigin() ? prev.depth() : -1; in CreateChainedOrigin()
80 return prev; in CreateChainedOrigin()
85 return prev; in CreateChainedOrigin()
90 return prev; in CreateChainedOrigin()
95 GetChainedOriginDepot()->Put(h.id(), prev.raw_id(), &chained_id); in CreateChainedOrigin()
/llvm-project-15.0.7/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py30 def diff_dicts(curr, prev): argument
31 removed = [k for k in prev if k not in curr or curr[k] != prev[k]]
32 added = [k for k in curr if k not in prev or curr[k] != prev[k]]
41 def diff(self, prev): argument
44 def is_different(self, prev): argument
141 def is_different(self, prev): argument
153 def diff_frames(self, prev): argument
173 def is_different(self, prev): argument
204 def is_different(self, prev): argument
223 def is_different(self, prev): argument
[all …]
/llvm-project-15.0.7/lldb/include/lldb/Utility/
H A DRangeMap.h223 prev = pos++) { in IsSorted()
224 if (prev != end && *pos < *prev) in IsSorted()
387 auto prev = pos - 1; in CombinePrevAndNext() local
390 pos = prev; in CombinePrevAndNext()
466 prev = pos++) { in IsSorted()
467 if (prev != end && *pos < *prev) in IsSorted()
485 prev = pos++) { in CombineConsecutiveEntriesWithEqualData()
486 if (prev != end && prev->data == pos->data) { in CombineConsecutiveEntriesWithEqualData()
498 if (prev != end && prev->data == pos->data) in CombineConsecutiveEntriesWithEqualData()
738 prev = pos++) { in IsSorted()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/msan/
H A Dmsan_origin.h109 static Origin CreateChainedOrigin(Origin prev, StackTrace *stack) { in CreateChainedOrigin() argument
110 int depth = prev.isChainedOrigin() ? prev.depth() : 0; in CreateChainedOrigin()
115 return prev; in CreateChainedOrigin()
123 if (!h.valid()) return prev; in CreateChainedOrigin()
127 if (use_count > flags()->origin_history_per_stack_limit) return prev; in CreateChainedOrigin()
131 bool inserted = ChainedOriginDepotPut(h.id(), prev.raw_id(), &chained_id); in CreateChainedOrigin()
/llvm-project-15.0.7/clang/test/Analysis/
H A Diterator-range.cpp682 auto j = std::prev(i); // no-warning in prev_plus_1_behind_begin()
687 auto j = std::prev(i); // no-warning in prev_plus_1_unknown()
692 auto j = std::prev(i); // no-warning in prev_plus_1_ahead_of_end()
697 auto j = std::prev(i); // no-warning in prev_plus_1_end()
744 auto j = std::prev(i, 2); // no-warning in prev_plus_2_unknown()
749 auto j = std::prev(i, 2); // no-warning in prev_plus_2_ahead_of_end()
754 auto j = std::prev(i, 2); // no-warning in prev_plus_2_end()
790 auto j = std::prev(i, 0); // no-warning in prev_0_begin()
795 auto j = std::prev(i, 0); // no-warning in prev_0_behind_begin()
800 auto j = std::prev(i, 0); // no-warning in prev_0_unknown()
[all …]
/llvm-project-15.0.7/flang/include/flang/Parser/
H A Dparse-state.h195 void CombineFailedParses(ParseState &&prev) { in CombineFailedParses() argument
196 if (prev.anyTokenMatched_) { in CombineFailedParses()
197 if (!anyTokenMatched_ || prev.p_ > p_) { in CombineFailedParses()
199 p_ = prev.p_; in CombineFailedParses()
200 messages_ = std::move(prev.messages_); in CombineFailedParses()
201 } else if (prev.p_ == p_) { in CombineFailedParses()
202 messages_.Merge(std::move(prev.messages_)); in CombineFailedParses()
205 anyDeferredMessages_ |= prev.anyDeferredMessages_; in CombineFailedParses()
206 anyConformanceViolation_ |= prev.anyConformanceViolation_; in CombineFailedParses()
207 anyErrorRecovery_ |= prev.anyErrorRecovery_; in CombineFailedParses()
/llvm-project-15.0.7/libcxx/test/std/iterators/iterator.primitives/iterator.operations/
H A Dprev.pass.cpp25 static_assert(std::is_same<decltype(std::prev(it, n)), It>::value, ""); in check_prev_n()
26 assert(std::prev(it, n) == result); in check_prev_n()
28 It (*prev_ptr)(It, typename std::iterator_traits<It>::difference_type) = std::prev; in check_prev_n()
36 static_assert(std::is_same<decltype(std::prev(it)), It>::value, ""); in check_prev_1()
37 assert(std::prev(it) == result); in check_prev_1()
/llvm-project-15.0.7/libc/AOR_v20.02/math/test/
H A Dmathbench.c430 double prev = z; in run_latency() local
432 prev = f (A[i] + prev * z); in run_latency()
439 float prev = z; in runf_latency() local
441 prev = f (Af[i] + prev * z); in runf_latency()
462 v_double prev = z; in run_v_latency() local
464 prev = f (v_double_load (A+i) + prev * z); in run_v_latency()
471 v_float prev = z; in runf_v_latency() local
473 prev = f (v_float_load (Af+i) + prev * z); in runf_v_latency()
497 prev = f (v_double_load (A+i) + prev * z); in run_vn_latency()
504 v_float prev = z; in runf_vn_latency() local
[all …]
/llvm-project-15.0.7/lldb/test/API/functionalities/postmortem/FreeBSDKernel/tools/
H A Dlldb-minimize-processes.patch18 + lldb::addr_t prev = 0;
53 + if (prev != 0) {
54 + printf("will link %d to %d\n", prev, proc);
55 + if (!WritePointerToMemory(prev + offset_p_list, proc, error))
58 + prev = proc;
61 + printf("last: %d\n", prev);
62 + if (!WritePointerToMemory(prev + offset_p_list, 0, error))
/llvm-project-15.0.7/mlir/lib/Analysis/DataFlow/
H A DDenseAnalysis.cpp75 if (Operation *prev = op->getPrevNode()) in visitOperation() local
76 before = getLatticeFor(op, prev); in visitOperation()
110 if (Operation *prev = callsite->getPrevNode()) in visitBlock() local
111 join(after, *getLatticeFor(block, prev)); in visitBlock()
153 if (Operation *prev = op->getPrevNode()) in visitRegionBranchOperation() local
154 before = getLatticeFor(point, prev); in visitRegionBranchOperation()
/llvm-project-15.0.7/llvm/test/Transforms/LoopInterchange/
H A Dprofitability.ll31 %j.prev = add nsw i64 %j, -1
32 …= getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @A, i64 0, i64 %j.prev, i64 %i30
68 %i.prev = add nsw i64 %i35, -1
73 %j.prev = add nsw i64 %j, -1
74 …etelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @A, i64 0, i64 %j.prev, i64 %i.prev
76 …etelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @B, i64 0, i64 %j.prev, i64 %i.prev
107 %i.prev = add nsw i64 %i34, -1
112 %j.prev = add nsw i64 %j, -1
113 …etelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* @A, i64 0, i64 %i.prev, i64 %j.prev
/llvm-project-15.0.7/libc/src/__support/CPP/
H A Dblockstore.h54 Block *prev = nullptr; in getLastBlocks() local
56 for (; curr->next; prev = curr, curr = curr->next) in getLastBlocks()
59 return {curr, prev}; in getLastBlocks()
146 auto [last, prev] = getLastBlocks(); in pop_back()
151 assert(prev->next == last); in pop_back()
152 current = prev; in pop_back()

12345678910>>...17