| /llvm-project-15.0.7/clang-tools-extra/unittests/clang-doc/ |
| H A D | MDGeneratorTest.cpp | 219 CommentInfo Top; in TEST() local
220 Top.Kind = "FullComment"; in TEST()
223 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
229 CommentInfo *Brief = Top.Children.back().get(); in TEST()
237 CommentInfo *Extended = Top.Children.back().get(); in TEST()
247 CommentInfo *HTML = Top.Children.back().get(); in TEST()
268 CommentInfo *Verbatim = Top.Children.back().get(); in TEST()
277 CommentInfo *ParamOut = Top.Children.back().get(); in TEST()
293 CommentInfo *ParamIn = Top.Children.back().get(); in TEST()
308 CommentInfo *Return = Top.Children.back().get(); in TEST()
[all …]
|
| H A D | BitcodeTest.cpp | 169 CommentInfo Top; in TEST() local
170 Top.Kind = "FullComment"; in TEST()
173 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
179 CommentInfo *Brief = Top.Children.back().get(); in TEST()
187 CommentInfo *Extended = Top.Children.back().get(); in TEST()
197 CommentInfo *HTML = Top.Children.back().get(); in TEST()
218 CommentInfo *Verbatim = Top.Children.back().get(); in TEST()
227 CommentInfo *ParamOut = Top.Children.back().get(); in TEST()
243 CommentInfo *ParamIn = Top.Children.back().get(); in TEST()
258 CommentInfo *Return = Top.Children.back().get(); in TEST()
[all …]
|
| H A D | YAMLGeneratorTest.cpp | 275 CommentInfo Top; in TEST() local
276 Top.Kind = "FullComment"; in TEST()
279 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
285 CommentInfo *Brief = Top.Children.back().get(); in TEST()
293 CommentInfo *Extended = Top.Children.back().get(); in TEST()
303 CommentInfo *HTML = Top.Children.back().get(); in TEST()
324 CommentInfo *Verbatim = Top.Children.back().get(); in TEST()
333 CommentInfo *ParamOut = Top.Children.back().get(); in TEST()
349 CommentInfo *ParamIn = Top.Children.back().get(); in TEST()
364 CommentInfo *Return = Top.Children.back().get(); in TEST()
[all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Generic/ |
| H A D | select.ll | 44 br label %Top
46 Top: ; preds = %Next, %Top, %0
53 Next: ; preds = %Top
54 br label %Top
83 br label %Top
85 Top: ; preds = %loop, %0
91 loop: ; preds = %loop, %Top
98 retlbl: ; preds = %Top
126 br label %Top
128 Top: ; preds = %Top, %0
[all …]
|
| H A D | fwdtwice.ll | 17 br label %Top
19 Top: ; preds = %Top, %0
24 br i1 %cond1001, label %bb6, label %Top
26 bb6: ; preds = %Top
|
| /llvm-project-15.0.7/llvm/test/Analysis/LoopInfo/ |
| H A D | 2003-02-19-LoopInfoNestingBug.ll | 3 ; and instead nests it just inside loop "Top"
9 br label %Top
11 Top: ; preds = %Out, %0
20 LoopHeader: ; preds = %Inner, %Top
24 br i1 false, label %Top, label %Done
|
| /llvm-project-15.0.7/compiler-rt/lib/scudo/standalone/tests/ |
| H A D | memtag_test.cpp | 77 for (u64 Top = 0; Top < 0x100; ++Top) in TEST_F() local
78 Tags = Tags | (1u << extractTag(Addr | (Top << 56))); in TEST_F()
93 for (u64 Top = 0; Top < 0x100; ++Top) { in TEST_F() local
94 uptr Ptr = (Addr | (Top << 56)) & UnTagMask; in TEST_F()
|
| /llvm-project-15.0.7/llvm/test/Transforms/CallSiteSplitting/ |
| H A D | callsite-split-callbr.ll | 4 ; Check that we can split the critical edge between Top and CallSiteBB, and
9 ; CHECK-NEXT: Top:
11 ; CHECK-NEXT: to label [[NEXTCOND:%.*]] [label %Top.split]
12 ; CHECK: Top.split:
29 Top:
37 %phi = phi i1 [0, %Top],[1, %NextCond]
|
| H A D | musttail.ll | 4 ;CHECK-LABEL: Top.split:
13 Top:
32 ;CHECK-LABEL: Top.split:
39 Top:
53 ;CHECK-LABEL: Top.split:
60 Top:
80 ;CHECK-LABEL: Top.split:
87 Top:
|
| H A D | convergent.ll | 9 br label %Top
11 Top:
20 %p = phi i1 [ false, %Top ], [ %c, %NextCond ]
50 br label %Top
52 Top:
61 %p = phi i1 [ false, %Top ], [ %c, %NextCond ]
|
| H A D | noduplicate.ll | 10 br label %Top
12 Top:
21 %p = phi i1 [ false, %Top ], [ %c, %NextCond ]
51 br label %Top
53 Top:
62 %p = phi i1 [ false, %Top ], [ %c, %NextCond ]
|
| H A D | callsite-split.ll | 10 ;CHECK-LABEL: Top.split:
19 br label %Top
21 Top:
30 %p = phi i1 [0, %Top], [%c, %NextCond]
72 ;CHECK-LABEL: Top.split:
81 br label %Top
83 Top:
92 %phi = phi i1 [0, %Top],[1, %NextCond]
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | VLIWMachineScheduler.cpp | 274 Top.init(DAG, SchedModel); in initialize()
282 delete Top.HazardRec; in initialize()
287 delete Top.ResourceModel; in initialize()
315 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
618 if (Top.isLatencyBound(SU)) { in SchedulingCost()
665 if (Top.isLatencyBound(SU)) in SchedulingCost()
952 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
958 SU = Top.pickOnlyChoice(); in pickNode()
983 Top.removeReady(SU); in pickNode()
1001 Top.bumpNode(SU); in schedNode()
[all …]
|
| H A D | MachineScheduler.cpp | 2916 if (!Top.HazardRec) { in initialize()
2917 Top.HazardRec = in initialize()
3398 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
3432 Top.removeReady(SU); in pickNode()
3475 Top.bumpNode(SU); in schedNode()
3524 if (!Top.HazardRec) { in initialize()
3525 Top.HazardRec = in initialize()
3609 assert(Top.Available.empty() && Top.Pending.empty() && "ReadyQ garbage"); in pickNode()
3614 SU = Top.pickOnlyChoice(); in pickNode()
3631 Top.removeReady(SU); in pickNode()
[all …]
|
| /llvm-project-15.0.7/llvm/tools/llvm-xray/ |
| H A D | xray-stacks.cpp | 384 auto &Top = TS.back(); in accountRecord() local
385 auto I = find_if(Top.first->Callees, in accountRecord()
387 if (I == Top.first->Callees.end()) { in accountRecord()
391 Top.first->Callees.emplace_back(N); in accountRecord()
454 for (auto *F = Top; F != nullptr; F = F->Parent) in printStack()
570 auto *Top = S.pop_back_val(); in printAll() local
572 for (const auto *C : Top->Callees) in printAll()
623 auto *Top = S.pop_back_val(); in print() local
633 auto E = std::make_pair(Top, TopSum); in print()
641 std::make_pair(Top, Top->ExtraData.TerminalDurations.size()); in print()
[all …]
|
| H A D | xray-account.cpp | 189 const auto &Top = ThreadStack.Stack.back(); in accountRecord() local
191 (*ThreadStack.RecursionDepth)[Top.first].isRecursive()) in accountRecord()
192 recordLatency(Top.first, diff(Top.second, Record.TSC)); in accountRecord()
194 --(*ThreadStack.RecursionDepth)[Top.first]; in accountRecord()
245 for (auto &Top : reverse(R)) { in accountRecord() local
247 --(*ThreadStack.RecursionDepth)[Top.first]; in accountRecord()
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-xray/X86/ |
| H A D | stack-multithread.yaml | 35 # PER-THREAD: Top 10 Stacks by leaf sum:
41 # PER-THREAD: Top 10 Stacks by leaf count:
48 # AGGREGATE: Top 10 Stacks by leaf sum:
67 # AGGREGATE: Top 10 Stacks by leaf count:
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/index/ |
| H A D | MemIndex.cpp | 33 TopN<std::pair<float, const Symbol *>> Top( in fuzzyFind() local
48 if (Top.push({*Score * quality(*Sym), Sym})) in fuzzyFind()
51 auto Results = std::move(Top).items(); in fuzzyFind()
|
| /llvm-project-15.0.7/compiler-rt/lib/xray/tests/unit/ |
| H A D | segmented_array_test.cpp | 218 const auto &Top = Data.back(); in TEST() local
219 uint64_t *TopNode = Top.NodePtr; in TEST()
255 const auto &Top = Data->back(); in TEST() local
256 uint64_t *TopNode = Top.NodePtr; in TEST()
294 const auto &Top = Data->back(); in TEST() local
295 uint64_t *TopNode = Top.NodePtr; in TEST()
|
| /llvm-project-15.0.7/llvm/test/Transforms/SampleProfile/ |
| H A D | inline-mergeprof-dup.ll | 9 br label %Top
11 Top:
20 %p = phi i1 [0, %Top], [%c, %NextCond]
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | VLIWMachineScheduler.h | 211 VLIWSchedBoundary Top; variable
221 ConvergingVLIWScheduler() : Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {} in ConvergingVLIWScheduler()
235 return Top.ResourceModel->getTotalPackets() + in reportPackets()
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | BitTracker.h | 157 Top, // Bit not yet defined. enumerator
194 BitValue(ValueType T = Top) : Type(T) {} in Type()
233 if (V.Type == Top) // This.meet(Top) = This in meet()
241 if (Type == Top) { in meet()
375 RC.Bits[i] = BitValue(BitValue::Top); in top()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | CFG.cpp | 48 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back(); in FindFunctionBackedges() local
49 const BasicBlock *ParentBB = Top.first; in FindFunctionBackedges()
50 const_succ_iterator &I = Top.second; in FindFunctionBackedges()
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCMachineScheduler.cpp | 188 if (tryLess(Top.getLatencyStallCycles(TryCand.SU), in tryCandidate()
189 Top.getLatencyStallCycles(Cand.SU), TryCand, Cand, Stall)) in tryCandidate()
207 if (Cand.Policy.ReduceLatency && tryLatency(TryCand, Cand, Top)) { in tryCandidate()
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | GCNSchedStrategy.cpp | 195 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional()
202 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional()
206 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); in pickNodeBidirectional()
233 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); in pickNodeBidirectional()
241 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); in pickNodeBidirectional()
267 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
274 SU = Top.pickOnlyChoice(); in pickNode()
278 pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand); in pickNode()
299 Top.removeReady(SU); in pickNode()
|