/external/swiftshader/third_party/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 | matrix.c | 84 _math_matrix_frustum( ctx->CurrentStack->Top, in _mesa_Frustum() 129 _math_matrix_ortho( ctx->CurrentStack->Top, in _mesa_Ortho() 267 stack->Top = &(stack->Stack[stack->Depth]); in _mesa_PushMatrix() 306 stack->Top = &(stack->Stack[stack->Depth]); in _mesa_PopMatrix() 330 _math_matrix_set_identity( ctx->CurrentStack->Top ); in _mesa_LoadIdentity() 359 if (memcmp(m, ctx->CurrentStack->Top->m, 16 * sizeof(GLfloat)) != 0) { in _mesa_LoadMatrixf() 361 _math_matrix_loadf( ctx->CurrentStack->Top, m ); in _mesa_LoadMatrixf() 392 _math_matrix_mul_floats( ctx->CurrentStack->Top, m ); in _mesa_MultMatrixf() 418 _math_matrix_rotate( ctx->CurrentStack->Top, angle, x, y, z); in _mesa_Rotatef() 443 _math_matrix_scale( ctx->CurrentStack->Top, x, y, z); in _mesa_Scalef() [all …]
|
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()
|
/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/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/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 …]
|
D | HexagonMachineScheduler.h | 194 VLIWSchedBoundary Top; variable 206 : DAG(nullptr), SchedModel(nullptr), Top(TopQID, "TopQ"), in ConvergingVLIWScheduler() 220 return Top.ResourceModel->getTotalPackets() + in ReportPackets()
|
D | BitTracker.h | 107 Top, // Bit not yet defined. enumerator 144 BitValue(ValueType T = Top) : Type(T) {} in Type() 182 if (V.Type == Top) // This.meet(Top) = This in meet() 190 if (Type == Top) { in meet() 324 RC.Bits[i] = BitValue(BitValue::Top); in top()
|
/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/swiftshader/third_party/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/harfbuzz_ng/src/ |
D | gen-use-table.py | 252 'Abv': [Top], 257 'Abv': [Top], 263 'Abv': [Top], 267 'Abv': [Top, Top_And_Bottom, Top_And_Bottom_And_Right, Top_And_Right], 273 'Abv': [Top], 279 'Abv': [Top], 308 if U == 0x20F0: UISC = Cantillation_Mark; UIPC = Top 329 if 0xA926 <= U <= 0xA92A: UIPC = Top 331 if U == 0x11300: UIPC = Top 335 if 0x1CF8 <= U <= 0x1CF9: UIPC = Top
|
/external/v8/src/compiler/ |
D | state-values-utils.cc | 313 SparseInputMask::InputIterator* StateValuesAccess::iterator::Top() { in Top() function in v8::internal::compiler::StateValuesAccess::iterator 337 Top()->Advance(); in Advance() 343 SparseInputMask::InputIterator* top = Top(); in EnsureValid() 358 Top()->Advance(); in EnsureValid() 377 Node* StateValuesAccess::iterator::node() { return Top()->Get(nullptr); } in node() 380 Node* parent = Top()->parent(); in type() 386 if (Top()->IsEmpty()) { in type() 390 return (*types)[Top()->real_index()]; in type()
|
/external/tensorflow/tensorflow/core/lib/gif/ |
D | gif_io.cc | 99 int imgTop = img_desc->Top; in Decode() 101 int imgBottom = img_desc->Top + img_desc->Height; in Decode() 103 if (img_desc->Left != 0 || img_desc->Top != 0 || img_desc->Width != width || in Decode() 137 this_image->RasterBits[(i - img_desc->Top) * (img_desc->Width) + in Decode()
|
/external/mesa3d/src/mesa/tnl/ |
D | t_vb_normals.c | 61 if (_math_matrix_is_general_scale(ctx->ModelviewMatrixStack.Top)) in run_normal_stage() 66 store->NormalTransform( ctx->ModelviewMatrixStack.Top, in run_normal_stage() 108 if (_math_matrix_has_rotation(ctx->ModelviewMatrixStack.Top)) { in validate_normal_stage()
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
D | DepthFirstIterator.h | 103 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back(); in toNext() local 104 NodeType *Node = Top.first.getPointer(); in toNext() 105 ChildItTy &It = Top.second; in toNext() 106 if (!Top.first.getInt()) { in toNext() 109 Top.first.setInt(1); in toNext()
|
/external/llvm/lib/Target/WebAssembly/ |
D | WebAssemblyFixIrreducibleControlFlow.cpp | 149 SuccessorList &Top = LoopWorklist.back(); in VisitLoop() local 150 if (Top.HasNext()) { in VisitLoop() 151 MachineBasicBlock *Next = Top.Next(); in VisitLoop() 165 RewriteSuccs.insert(Top.getBlock()); in VisitLoop() 169 OnStack.erase(Top.getBlock()); in VisitLoop()
|
/external/llvm/include/llvm/ADT/ |
D | DepthFirstIterator.h | 104 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back(); in toNext() local 105 NodeType *Node = Top.first.getPointer(); in toNext() 106 ChildItTy &It = Top.second; in toNext() 107 if (!Top.first.getInt()) { in toNext() 110 Top.first.setInt(1); in toNext()
|
/external/libxml2/result/HTML/ |
D | fp40.htm.sax | 146 SAX.characters(Top of Page, 11) 211 SAX.characters(Top of Section, 14) 251 SAX.characters(Top of Section, 14) 290 SAX.characters(Top of Section, 14) 346 SAX.characters(Top of Page, 11) 377 SAX.characters(Top of Section, 14) 407 SAX.characters(Top of Section, 14) 440 SAX.characters(Top of Section, 14)
|
/external/annotation-tools/annotation-file-utilities/tests/ |
D | ExtImpl.java | 4 class Top<X, Y> {} class in ExtImpl 10 class C1 extends Top<Object, String> implements Iface<Integer, String> {}
|
/external/pdfium/core/fxcrt/css/ |
D | cfx_css.h | 39 Top, enumerator 84 Top, enumerator 162 Top, enumerator
|
/external/icu/icu4c/source/test/testdata/ |
D | ra.txt | 17 * Top level comments for the string.Tag name: test1 31 * Top level comments for TestTable. Tag name: TestTable 62 * Top level comments for Tag name: TestArray
|
/external/llvm/lib/CodeGen/ |
D | MachineScheduler.cpp | 2543 Top.init(DAG, SchedModel, &Rem); in initialize() 2551 if (!Top.HazardRec) { in initialize() 2552 Top.HazardRec = in initialize() 2945 if (SUnit *SU = Top.pickOnlyChoice()) { in pickNodeBidirectional() 2953 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); in pickNodeBidirectional() 2957 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); in pickNodeBidirectional() 2984 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); in pickNodeBidirectional() 2992 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); in pickNodeBidirectional() 3018 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode() 3025 SU = Top.pickOnlyChoice(); in pickNode() [all …]
|
/external/llvm/lib/Analysis/ |
D | CFG.cpp | 41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back(); in FindFunctionBackedges() local 42 const BasicBlock *ParentBB = Top.first; in FindFunctionBackedges() 43 succ_const_iterator &I = Top.second; in FindFunctionBackedges()
|