| /external/llvm-project/clang-tools-extra/unittests/clang-doc/ |
| D | MDGeneratorTest.cpp | 219 CommentInfo Top; in TEST() local
220 Top.Kind = "FullComment"; in TEST()
222 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
223 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
228 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
229 CommentInfo *Brief = Top.Children.back().get(); in TEST()
236 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
237 CommentInfo *Extended = Top.Children.back().get(); in TEST()
246 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
247 CommentInfo *HTML = Top.Children.back().get(); in TEST()
[all …]
|
| D | BitcodeTest.cpp | 169 CommentInfo Top; in TEST() local
170 Top.Kind = "FullComment"; in TEST()
172 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
173 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
178 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
179 CommentInfo *Brief = Top.Children.back().get(); in TEST()
186 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
187 CommentInfo *Extended = Top.Children.back().get(); in TEST()
196 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
197 CommentInfo *HTML = Top.Children.back().get(); in TEST()
[all …]
|
| D | YAMLGeneratorTest.cpp | 275 CommentInfo Top; in TEST() local
276 Top.Kind = "FullComment"; in TEST()
278 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
279 CommentInfo *BlankLine = Top.Children.back().get(); in TEST()
284 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
285 CommentInfo *Brief = Top.Children.back().get(); in TEST()
292 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
293 CommentInfo *Extended = Top.Children.back().get(); in TEST()
302 Top.Children.emplace_back(std::make_unique<CommentInfo>()); in TEST()
303 CommentInfo *HTML = Top.Children.back().get(); in TEST()
[all …]
|
| /external/llvm-project/llvm/test/CodeGen/Generic/ |
| D | select.ll | 44 br label %Top
46 Top: ; preds = %Next, %Top, %0
47 phi i32 [ 0, %0 ], [ 1, %Top ], [ 524288, %Next ] ; <i32>:1 [#uses=0]
48 …phi float [ 0.000000e+00, %0 ], [ 1.000000e+00, %Top ], [ 2.000000e+00, %Next ] ; <float>:…
49 phi double [ 5.000000e-01, %0 ], [ 1.500000e+00, %Top ], [ 2.500000e+00, %Next ]
50 phi i1 [ true, %0 ], [ false, %Top ], [ true, %Next ] ; <i1>:4 [#uses=0]
51 br i1 true, label %Top, label %Next
53 Next: ; preds = %Top
54 br label %Top
83 br label %Top
[all …]
|
| D | fwdtwice.ll | 17 br label %Top
19 Top: ; preds = %Top, %0
24 br i1 %cond1001, label %bb6, label %Top
26 bb6: ; preds = %Top
|
| /external/llvm/test/CodeGen/Generic/ |
| D | select.ll | 44 br label %Top
46 Top: ; preds = %Next, %Top, %0
47 phi i32 [ 0, %0 ], [ 1, %Top ], [ 524288, %Next ] ; <i32>:1 [#uses=0]
48 …phi float [ 0.000000e+00, %0 ], [ 1.000000e+00, %Top ], [ 2.000000e+00, %Next ] ; <float>:…
49 phi double [ 5.000000e-01, %0 ], [ 1.500000e+00, %Top ], [ 2.500000e+00, %Next ]
50 phi i1 [ true, %0 ], [ false, %Top ], [ true, %Next ] ; <i1>:4 [#uses=0]
51 br i1 true, label %Top, label %Next
53 Next: ; preds = %Top
54 br label %Top
83 br label %Top
[all …]
|
| D | fwdtwice.ll | 17 br label %Top
19 Top: ; preds = %Top, %0
24 br i1 %cond1001, label %bb6, label %Top
26 bb6: ; preds = %Top
|
| /external/mesa3d/src/mesa/main/ |
| D | clip.c | 41 if (_math_matrix_is_dirty(ctx->ProjectionMatrixStack.Top)) in _mesa_update_clip_plane()
42 _math_matrix_analyse( ctx->ProjectionMatrixStack.Top ); in _mesa_update_clip_plane()
47 ctx->ProjectionMatrixStack.Top->inv); in _mesa_update_clip_plane()
77 if (_math_matrix_is_dirty(ctx->ModelviewMatrixStack.Top)) in _mesa_ClipPlane()
78 _math_matrix_analyse( ctx->ModelviewMatrixStack.Top ); in _mesa_ClipPlane()
81 ctx->ModelviewMatrixStack.Top->inv ); in _mesa_ClipPlane()
|
| D | matrix.c | 120 _math_matrix_frustum(stack->Top, in matrix_frustum()
201 _math_matrix_ortho( stack->Top, in matrix_ortho()
328 stack->Top = &(stack->Stack[stack->Depth]); in push_matrix()
375 stack->Top = &(stack->Stack[stack->Depth]); in pop_matrix()
444 _math_matrix_set_identity(stack->Top); in _mesa_load_identity_matrix()
487 if (memcmp(m, stack->Top->m, 16 * sizeof(GLfloat)) != 0) { in _mesa_load_matrix()
489 _math_matrix_loadf(stack->Top, m); in _mesa_load_matrix()
568 _math_matrix_mul_floats(stack->Top, m); in matrix_mult()
613 _math_matrix_rotate(stack->Top, angle, x, y, z); in matrix_rotate()
673 _math_matrix_scale( ctx->CurrentStack->Top, x, y, z); in _mesa_Scalef()
[all …]
|
| /external/capstone/bindings/vb6/ |
| D | Form1.frm | 18 Top = 120
27 Top = 120
36 Top = 120
45 Top = 120
54 Top = 120
63 Top = 120
70 Top = 1440
111 Top = 600
130 Top = 3840
|
| /external/llvm/test/Other/ |
| 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
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 206 Top.init(DAG, SchedModel); in initialize()
214 delete Top.HazardRec; in initialize()
216 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize()
219 delete Top.ResourceModel; in initialize()
221 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel()); in initialize()
237 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
242 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode()
495 if (Top.ResourceModel->isResourceAvailable(SU)) in SchedulingCost()
592 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidrectional()
615 CandResult TopResult = pickNodeFromQueue(Top.Available, in pickNodeBidrectional()
[all …]
|
| /external/llvm-project/llvm/test/Analysis/LoopInfo/ |
| D | 2003-02-19-LoopInfoNestingBug.ll | 3 ; and instead nests it just inside loop "Top"
10 br label %Top
12 Top: ; preds = %Out, %0
21 LoopHeader: ; preds = %Inner, %Top
25 br i1 false, label %Top, label %Done
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 257 Top.init(DAG, SchedModel); in initialize()
265 delete Top.HazardRec; in initialize()
267 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize()
270 delete Top.ResourceModel; in initialize()
272 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel()); in initialize()
296 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
301 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode()
598 if (Top.isLatencyBound(SU)) { in SchedulingCost()
611 if (Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost()
645 if (Top.isLatencyBound(SU)) in SchedulingCost()
[all …]
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 257 Top.init(DAG, SchedModel); in initialize()
265 delete Top.HazardRec; in initialize()
267 Top.HazardRec = TII->CreateTargetMIHazardRecognizer(Itin, DAG); in initialize()
270 delete Top.ResourceModel; in initialize()
272 Top.ResourceModel = new VLIWResourceModel(STI, DAG->getSchedModel()); in initialize()
296 Top.MaxMinLatency = std::max(MinLatency, Top.MaxMinLatency); in releaseTopNode()
301 Top.releaseNode(SU, SU->TopReadyCycle); in releaseTopNode()
598 if (Top.isLatencyBound(SU)) { in SchedulingCost()
611 if (Top.ResourceModel->isResourceAvailable(SU, true)) { in SchedulingCost()
645 if (Top.isLatencyBound(SU)) in SchedulingCost()
[all …]
|
| /external/llvm-project/llvm/test/Transforms/CallSiteSplitting/ |
| 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-LABEL: Top.split:
29 Top:
37 %phi = phi i1 [0, %Top],[1, %NextCond]
|
| 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:
|
| 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 ]
|
| 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 ]
|
| 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]
|
| /external/llvm-project/llvm/tools/llvm-xray/ |
| 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()
390 auto N = createTrieNode(R.TId, R.FuncId, Top.first); in accountRecord()
391 Top.first->Callees.emplace_back(N); in accountRecord()
449 void printStack(raw_ostream &OS, const StackTrieNode *Top, in printStack() argument
454 for (auto *F = Top; F != nullptr; F = F->Parent) in printStack()
571 auto *Top = S.pop_back_val(); in printAll() local
572 printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top); in printAll()
573 for (const auto *C : Top->Callees) in printAll()
[all …]
|
| /external/harfbuzz_ng/src/ |
| D | gen-use-table.py | 295 'Abv': [Top],
300 'Abv': [Top],
306 'Abv': [Top],
310 'Abv': [Top, Top_And_Bottom, Top_And_Bottom_And_Right, Top_And_Right],
316 'Abv': [Top],
322 'Abv': [Top],
329 'Abv': [Top],
353 if UIPC == Top:
359 if UIPC == Top:
362 UIPC = Top
[all …]
|
| /external/tensorflow/tensorflow/lite/tools/evaluation/tasks/imagenet_image_classification/ |
| D | README.md | 8 * Top-K (1 to 10) accuracy values
18 Top-1 Accuracy: 0.733333
19 Top-2 Accuracy: 0.826667
20 Top-3 Accuracy: 0.856667
21 Top-4 Accuracy: 0.87
22 Top-5 Accuracy: 0.89
23 Top-6 Accuracy: 0.903333
24 Top-7 Accuracy: 0.906667
25 Top-8 Accuracy: 0.913333
26 Top-9 Accuracy: 0.92
[all …]
|
| /external/rust/crates/codespan-reporting/src/term/ |
| D | renderer.rs | 41 Top(usize), enumerator
59 Top, enumerator
258 MultiLabel::Top(start) in render_snippet_source()
263 MultiLabel::Top(..) => self.inner_gutter_space()?, in render_snippet_source()
286 MultiLabel::Top(start) => column_range.start >= *start, in render_snippet_source()
536 MultiLabel::Top(start) if *start <= source.len() - source.trim_start().len() => { in render_snippet_source()
539 MultiLabel::Top(range) => (*label_style, range, None), in render_snippet_source()
560 MultiLabel::Top(..) if multi_label_index > *i => { in render_snippet_source()
566 MultiLabel::Top(..) if multi_label_index == *i => { in render_snippet_source()
567 underline = Some((*ls, VerticalBound::Top)); in render_snippet_source()
[all …]
|
| /external/llvm-project/llvm/lib/Target/AMDGPU/ |
| D | GCNSchedStrategy.cpp | 180 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional()
187 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional()
191 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); in pickNodeBidirectional()
218 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); in pickNodeBidirectional()
226 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); in pickNodeBidirectional()
252 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
259 SU = Top.pickOnlyChoice(); in pickNode()
263 pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand); in pickNode()
284 Top.removeReady(SU); in pickNode()
|