| /llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
| H A D | deduct.pass.cpp | 117 Cont cont; in main()
124 Cont cont; in main()
131 Cont cont; in main()
138 Cont cont; in main()
179 Cont cont; in main()
185 Cont cont; in main()
191 Cont cont; in main()
197 Cont cont; in main()
215 Cont cont; in main()
222 Cont cont; in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/queue/queue.cons/ |
| H A D | deduct.pass.cpp | 74 typedef std::list<T, Alloc> Cont; in main() typedef
80 Cont cont; in main()
86 Cont cont; in main()
92 Cont cont; in main()
98 Cont cont; in main()
107 typedef std::list<T, Alloc> Cont; in main() typedef
113 std::queue<T, Cont> source; in main()
119 std::queue<T, Cont> source; in main()
125 std::queue<T, Cont> source; in main()
131 std::queue<T, Cont> source; in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/stack/stack.cons/ |
| H A D | deduct.pass.cpp | 78 typedef std::list<T, Alloc> Cont; in main() typedef
84 Cont cont; in main()
90 Cont cont; in main()
96 Cont cont; in main()
102 Cont cont; in main()
111 typedef std::list<T, Alloc> Cont; in main() typedef
117 std::stack<T, Cont> source; in main()
123 std::stack<T, Cont> source; in main()
129 std::stack<T, Cont> source; in main()
135 std::stack<T, Cont> source; in main()
[all …]
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | ContainerModeling.cpp | 37 SVal Cont) const;
39 SVal Cont) const;
211 for (const auto &Cont : ContMap) { in checkLiveSymbols() local
212 const auto CData = Cont.second; in checkLiveSymbols()
232 for (const auto &Cont : ContMap) { in checkDeadSymbols() local
233 if (!SR.isLiveRegion(Cont.first)) { in checkDeadSymbols()
728 for (const auto &Cont : ContMap) { in printState() local
729 Cont.first->dumpToStream(Out); in printState()
731 const auto CData = Cont.second; in printState()
924 return Pos.getContainer() == Cont; in invalidateAllIteratorPositions()
[all …]
|
| H A D | Iterator.h | 30 const MemRegion *Cont;
39 : Cont(C), Valid(V), Offset(Of) {} in IteratorPosition()
42 const MemRegion *getContainer() const { return Cont; } in getContainer()
47 return IteratorPosition(Cont, false, Offset); in invalidate()
55 return IteratorPosition(Cont, Valid, NewOf); in setTo()
63 return Cont == X.Cont && Valid == X.Valid && Offset == X.Offset;
69 ID.AddPointer(Cont); in Profile()
163 const MemRegion *Cont);
169 const MemRegion *Cont, const Stmt* S,
|
| H A D | DebugContainerModeling.cpp | 88 const MemRegion *Cont = C.getSVal(CE->getArg(0)).getAsRegion(); in analyzerContainerDataField() local
89 if (Cont) { in analyzerContainerDataField()
90 const auto *Data = getContainerData(State, Cont); in analyzerContainerDataField()
102 [Cont, Field](PathSensitiveBugReport &BR) -> std::string { in analyzerContainerDataField()
104 BR.markInteresting(Cont); in analyzerContainerDataField()
|
| H A D | MismatchedIteratorChecker.cpp | 36 const MemRegion *Cont) const;
204 const MemRegion *Cont) const { in verifyMatch()
206 Cont = Cont->getMostDerivedObjectRegion(); in verifyMatch()
208 if (const auto *ContSym = Cont->getSymbolicBase()) { in verifyMatch()
229 if (IterCont != Cont) { in verifyMatch()
235 Iter, Cont, C, N); in verifyMatch()
|
| H A D | IteratorRangeChecker.cpp | 306 const auto *Cont = Pos.getContainer(); in isPastTheEnd() local
307 const auto *CData = getContainerData(State, Cont); in isPastTheEnd()
322 const auto *Cont = Pos.getContainer(); in isAheadOfRange() local
323 const auto *CData = getContainerData(State, Cont); in isAheadOfRange()
338 const auto *Cont = Pos.getContainer(); in isBehindPastTheEnd() local
339 const auto *CData = getContainerData(State, Cont); in isBehindPastTheEnd()
|
| H A D | IteratorModeling.cpp | 123 const MemRegion *Cont) const;
459 const MemRegion *Cont = nullptr; in handleComparison() local
461 Cont = LPos->getContainer(); in handleComparison()
463 Cont = RPos->getContainer(); in handleComparison()
465 if (!Cont) in handleComparison()
480 IteratorPosition::getPosition(Cont, Sym)); in handleComparison()
484 IteratorPosition::getPosition(Cont, Sym)); in handleComparison()
690 const MemRegion *Cont) const { in assignToContainer()
691 Cont = Cont->getMostDerivedObjectRegion(); in assignToContainer()
695 State = createIteratorPosition(State, RetVal, Cont, CE, LCtx, C.blockCount()); in assignToContainer()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons.alloc/ |
| H A D | ctor_iter_iter_comp_cont_alloc.pass.cpp | 21 template<class T, class Cont, class Comp = std::less<T> >
22 struct PQ : std::priority_queue<T, Cont, Comp> {
23 typedef std::priority_queue<T, Cont, Comp> base;
26 …explicit PQ(It first, It last, const Comp& compare, const Cont& v, const Alloc& a) : base(first, l… in PQ()
|
| H A D | ctor_iter_iter_comp_rcont_alloc.pass.cpp | 24 template<class T, class Cont, class Comp = std::less<T> >
25 struct PQ : std::priority_queue<T, Cont, Comp> {
26 typedef std::priority_queue<T, Cont, Comp> base;
29 …explicit PQ(It first, It last, const Comp& compare, Cont&& v, const Alloc& a) : base(first, last, … in PQ()
|
| H A D | ctor_iter_iter_alloc.pass.cpp | 21 template<class T, class Cont, class Comp = std::less<T> >
22 struct PQ : std::priority_queue<T, Cont, Comp> {
23 typedef std::priority_queue<T, Cont, Comp> base;
|
| H A D | ctor_iter_iter_comp_alloc.pass.cpp | 22 template<class T, class Cont, class Comp = std::less<T> >
23 struct PQ : std::priority_queue<T, Cont, Comp> {
24 typedef std::priority_queue<T, Cont, Comp> base;
|
| /llvm-project-15.0.7/llvm/test/Transforms/SCCP/ |
| H A D | 2003-08-26-InvokeHandling.ll | 8 br i1 %cond, label %Inv, label %Cont
13 br label %Cont
17 br label %Cont
18 Cont: ; preds = %Ok, %Inv, %Entry
|
| /llvm-project-15.0.7/llvm/test/Transforms/Mem2Reg/ |
| H A D | UndefValuesMerge.ll | 5 br i1 %C, label %T, label %Cont
8 br label %Cont
9 Cont: ; preds = %T, %0
|
| /llvm-project-15.0.7/llvm/test/ExecutionEngine/MCJIT/ |
| H A D | 2003-10-18-PHINode-ConstantExpr-CondCode-Failure.ll | 13 Cont: ; preds = %Taken1, %NotTaken
17 br label %Cont
20 br i1 %B, label %Cont, label %ExitError
|
| /llvm-project-15.0.7/llvm/test/Transforms/GlobalOpt/ |
| H A D | phi-select.ll | 18 br i1 %C, label %T, label %Cont
21 br label %Cont
23 Cont: ; preds = %T, %0
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | store.ll | 95 ; CHECK: Cont:
104 br label %Cont
108 br label %Cont
110 Cont:
121 ; CHECK: Cont:
127 br i1 %C, label %Cond, label %Cont
131 br label %Cont
133 Cont:
144 ; CHECK: Cont:
154 br label %Cont
[all …]
|
| /llvm-project-15.0.7/clang/test/Analysis/unified-sources/ |
| H A D | source1.cpp | 13 int testContainerMethodInHeaderFile(ContainerInHeaderFile Cont) { in testContainerMethodInHeaderFile() argument
14 return 1 / Cont.method(); // no-warning in testContainerMethodInHeaderFile()
|
| H A D | source2.cpp | 23 int testContainerMethodInCodeFile(ContainerInCodeFile Cont) { in testContainerMethodInCodeFile() argument
24 return 1 / Cont.method(); // expected-warning{{}} in testContainerMethodInCodeFile()
|
| /llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/ |
| H A D | PhiEliminate2.ll | 11 br label %Cont
14 br label %Cont
15 Cont:
|
| H A D | 2007-11-22-InvokeNoUnwind.ll | 9 to label %Cont unwind label %Other ; <i32>:1 [#uses=0]
11 Cont: ; preds = %0
|
| /llvm-project-15.0.7/llvm/test/Transforms/CodeExtractor/ |
| H A D | 2004-11-12-InvokeExtract.ll | 7 to label %Cont unwind label %Unw ; <i32> [#uses=1]
9 Cont: ; preds = %EB
|
| /llvm-project-15.0.7/llvm/test/Transforms/ADCE/ |
| H A D | dce_pure_invoke.ll | 8 to label %Cont unwind label %Other ; <i32>:1 [#uses=0]
10 Cont: ; preds = %0
|
| /llvm-project-15.0.7/llvm/test/Transforms/BDCE/ |
| H A D | dce-pure.ll | 17 to label %Cont unwind label %Other
19 Cont: ; preds = %0
|