| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/ |
| D | MicrosoftDemangle.h | 39 NewHead->Next = Head; in addNode()
41 Head = NewHead; in addNode()
49 while (Head) { in ~ArenaAllocator()
50 assert(Head->Buf); in ~ArenaAllocator()
51 delete[] Head->Buf; in ~ArenaAllocator()
52 AllocatorNode *Next = Head->Next; in ~ArenaAllocator()
53 delete Head; in ~ArenaAllocator() local
54 Head = Next; in ~ArenaAllocator()
59 assert(Head && Head->Buf); in allocUnalignedBuffer()
61 uint8_t *P = Head->Buf + Head->Used; in allocUnalignedBuffer()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | EarlyIfConversion.cpp | 89 MachineBasicBlock *Head; member in __anon1fac302f0111::SSAIfConv
105 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred()
108 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred()
273 if (!DefMI || DefMI->getParent() != Head) in InstrDependenciesAllowIfConv()
367 MachineBasicBlock::iterator FirstTerm = Head->getFirstTerminator(); in findInsertionPoint()
368 MachineBasicBlock::iterator I = Head->end(); in findInsertionPoint()
369 MachineBasicBlock::iterator B = Head->begin(); in findInsertionPoint()
433 Head = MBB; in canConvertIf()
436 if (Head->succ_size() != 2) in canConvertIf()
438 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvertIf()
[all …]
|
| D | ShadowStackGCLowering.cpp | 54 GlobalVariable *Head = nullptr; member in __anoncbe2320a0111::ShadowStackGCLowering
207 Head = M.getGlobalVariable("llvm_gc_root_chain"); in doInitialization()
208 if (!Head) { in doInitialization()
211 Head = new GlobalVariable( in doInitialization()
214 } else if (Head->hasExternalLinkage() && Head->isDeclaration()) { in doInitialization()
215 Head->setInitializer(Constant::getNullValue(StackEntryPtrTy)); in doInitialization()
216 Head->setLinkage(GlobalValue::LinkOnceAnyLinkage); in doInitialization()
317 AtEntry.CreateLoad(StackEntryTy->getPointerTo(), Head, "gc_currhead"); in runOnFunction()
348 AtEntry.CreateStore(NewHeadVal, Head); in runOnFunction()
360 AtExit->CreateStore(SavedHead, Head); in runOnFunction()
|
| D | MachineRegisterInfo.cpp | 268 MachineOperand *const Head = HeadRef; in addRegOperandToUseList() local
275 if (!Head) { in addRegOperandToUseList()
281 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!"); in addRegOperandToUseList()
284 MachineOperand *Last = Head->Contents.Reg.Prev; in addRegOperandToUseList()
287 Head->Contents.Reg.Prev = MO; in addRegOperandToUseList()
294 MO->Contents.Reg.Next = Head; in addRegOperandToUseList()
307 MachineOperand *const Head = HeadRef; in removeRegOperandFromUseList() local
308 assert(Head && "List already empty"); in removeRegOperandFromUseList()
315 if (MO == Head) in removeRegOperandFromUseList()
320 (Next ? Next : Head)->Contents.Reg.Prev = Prev; in removeRegOperandFromUseList()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64ConditionalCompares.cpp | 148 MachineBasicBlock *Head; member in __anona9b2253e0111::SSACCmpConv
225 if (MBB == Head) { in trivialTailPHIs()
439 Head = MBB; in canConvert()
442 if (Head->succ_size() != 2) in canConvert()
444 MachineBasicBlock *Succ0 = Head->succ_begin()[0]; in canConvert()
445 MachineBasicBlock *Succ1 = Head->succ_begin()[1]; in canConvert()
462 LLVM_DEBUG(dbgs() << "\nTriangle: " << printMBBReference(*Head) << " -> " in canConvert()
502 if (TII->analyzeBranch(*Head, TBB, FBB, HeadCond)) { in canConvert()
571 << printMBBReference(*Head) << ":\n" in convert()
580 BranchProbability Head2CmpBB = MBPI->getEdgeProbability(Head, CmpBB); in convert()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | ScoreboardHazardRecognizer.h | 48 size_t Head = 0; variable
64 return Data[(Head + idx) & (Depth-1)];
74 Head = 0;
78 Head = (Head + 1) & (Depth-1); in advance()
82 Head = (Head - 1) & (Depth-1); in recede()
|
| D | MachineTraceMetrics.h | 165 unsigned Head; member
205 if (Head != TBI.Head) in isUsefulDominator()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | Automaton.h | 98 PathSegment *Head = Heads[I]; in transition() local
101 auto PI = lower_bound(Pairs, NfaStatePair{Head->State, 0ULL}); in transition()
102 auto PE = upper_bound(Pairs, NfaStatePair{Head->State, INT64_MAX}); in transition()
106 if (PI->FromDfaState == Head->State) in transition()
107 Heads.push_back(makePathSegment(PI->ToDfaState, Head)); in transition()
143 for (auto *Head : Heads) { in getPaths()
145 while (Head->State != 0) { in getPaths()
146 P.push_back(Head->State); in getPaths()
147 Head = Head->Tail; in getPaths()
|
| D | Registry.h | 56 static node *Head, *Tail; variable
139 template<typename T> typename Registry<T>::node *Registry<T>::Head = nullptr;\
146 Head = N; \
150 return iterator(Head); \
152 template REGISTRY_CLASS::node *Registry<REGISTRY_CLASS::type>::Head; \
|
| D | OnDiskHashTable.h | 82 Item *Head; member
91 E->Next = B.Head; in insert()
93 B.Head = E; in insert()
102 for (Item *E = Buckets[I].Head; E;) { in resize()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
174 if (!B.Head) in Emit()
186 for (Item *I = B.Head; I; I = I->Next) { in Emit()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cordz_info_test.cc | 72 EXPECT_THAT(CordzInfo::Head(CordzSnapshot()), Eq(info)); in TEST()
137 EXPECT_THAT(CordzInfo::Head(CordzSnapshot()), Eq(nullptr)); in TEST()
164 EXPECT_THAT(CordzInfo::Head(CordzSnapshot()), Eq(info)); in TEST()
167 EXPECT_THAT(CordzInfo::Head(CordzSnapshot()), Eq(nullptr)); in TEST()
197 EXPECT_THAT(CordzInfo::Head(snapshot), Eq(nullptr)); in TEST()
202 ASSERT_THAT(CordzInfo::Head(snapshot), Eq(info1)); in TEST()
208 ASSERT_THAT(CordzInfo::Head(snapshot), Eq(info2)); in TEST()
213 ASSERT_THAT(CordzInfo::Head(snapshot), Eq(info1)); in TEST()
217 ASSERT_THAT(CordzInfo::Head(snapshot), Eq(nullptr)); in TEST()
222 EXPECT_THAT(CordzInfo::Head(snapshot), Eq(nullptr)); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | PrettyStackTrace.cpp | 63 PrettyStackTraceEntry *ReverseStackTrace(PrettyStackTraceEntry *Head) { in ReverseStackTrace() argument
65 while (Head) in ReverseStackTrace()
66 std::tie(Prev, Head, Head->NextEntry) = in ReverseStackTrace()
67 std::make_tuple(Head, Head->NextEntry, Prev); in ReverseStackTrace()
|
| /third_party/benchmark/src/ |
| D | benchmark_name.cc | 24 template <typename Head, typename... Tail>
25 size_t size_impl(const Head& head, const Tail&... tail) { in size_impl()
33 template <typename Head, typename... Tail>
34 void join_impl(std::string& s, const char delimiter, const Head& head, in join_impl()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | ImmutableList.h | 30 T Head; variable
35 : Head(std::forward<ElemT>(head)), Tail(tail) {} in Head() function
41 const T& getHead() const { return Head; } in getHead()
51 Profile(ID, Head, Tail); in Profile()
176 LLVM_NODISCARD ImmutableList<T> concat(ElemT &&Head, ImmutableList<T> Tail) { in concat() argument
182 ListTy::Profile(ID, Head, TailImpl); in concat()
189 new (L) ListTy(std::forward<ElemT>(Head), TailImpl); in concat()
|
| D | BreadthFirstIterator.h | 78 Optional<QueueElement> Head = VisitQueue.front(); in toNext() local
79 QueueElement H = Head.getValue(); in toNext()
96 Head = VisitQueue.front(); in toNext()
97 if (Head != None) in toNext()
|
| /third_party/googletest/googletest/include/gtest/internal/ |
| D | gtest-type-util.h | 127 using Head = TemplateSel<Head_>; member
133 using Head = TemplateSel<Head_>;
140 using Head = Head_;
146 using Head = Head_;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | BasicBlockUtils.cpp | 931 BasicBlock *Head = SplitBefore->getParent(); in SplitBlockAndInsertIfThen() local
932 BasicBlock *Tail = Head->splitBasicBlock(SplitBefore->getIterator()); in SplitBlockAndInsertIfThen()
933 Instruction *HeadOldTerm = Head->getTerminator(); in SplitBlockAndInsertIfThen()
934 LLVMContext &C = Head->getContext(); in SplitBlockAndInsertIfThen()
938 ThenBlock = BasicBlock::Create(C, "", Head->getParent(), Tail); in SplitBlockAndInsertIfThen()
952 if (DomTreeNode *OldNode = DT->getNode(Head)) { in SplitBlockAndInsertIfThen()
955 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen()
961 DT->addNewBlock(ThenBlock, Head); in SplitBlockAndInsertIfThen()
963 DT->changeImmediateDominator(ThenBlock, Head); in SplitBlockAndInsertIfThen()
968 if (Loop *L = LI->getLoopFor(Head)) { in SplitBlockAndInsertIfThen()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/types/internal/ |
| D | conformance_testing_helpers.h | 139 template <class Head, class... Tail>
140 struct IsEquivalenceClass<EquivalenceClassType<Head, Tail...>>
146 using result_type = typename IsNullaryCallable<Head>::result_type;
192 template <class Head, class... Tail>
195 ResultOfGeneratorT<Head>, ResultOfGeneratorT<Tail>>...>::value>::type,
196 Head, Tail...> : std::true_type {};
|
| /third_party/node/deps/brotli/c/enc/ |
| D | hash_forgetful_chain_inc.h | 71 static uint16_t* FN(Head)(void* extra) { in FN() argument
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in FN()
96 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FN()
134 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FN()
200 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FN()
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | hash_forgetful_chain_inc.h | 71 static uint16_t* FN(Head)(void* extra) { in FN() argument
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in FN()
96 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FN()
134 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FN()
200 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FN()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | ramdaToolsNoInfinite.types | 6 type Head<T extends any[]> =
7 >Head : Head<T>
40 1: Head<T>;
41 >1 : Head<T>
|
| /third_party/skia/tools/ |
| D | Registry.h | 39 static const Registry* Head() { return gHead; } in Head() function
52 Iterator begin() const { return Iterator{Registry::Head()}; } in begin()
|
| /third_party/flutter/skia/tools/ |
| D | Registry.h | 39 static const Registry* Head() { return gHead; } in Head() function
52 Iterator begin() const { return Iterator{Registry::Head()}; } in begin()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Demangle/ |
| D | MicrosoftDemangle.cpp | 1557 static NodeArrayNode *nodeListToNodeArray(ArenaAllocator &Arena, NodeList *Head, in nodeListToNodeArray() argument
1563 N->Nodes[I] = Head->N; in nodeListToNodeArray()
1564 Head = Head->Next; in nodeListToNodeArray()
1572 NodeList *Head = Arena.alloc<NodeList>(); in demangleNameScopeChain() local
1574 Head->N = UnqualifiedName; in demangleNameScopeChain()
1580 NewHead->Next = Head; in demangleNameScopeChain()
1581 Head = NewHead; in demangleNameScopeChain()
1593 Head->N = Elem; in demangleNameScopeChain()
1597 QN->Components = nodeListToNodeArray(Arena, Head, Count); in demangleNameScopeChain()
2083 NodeList *Head = Arena.alloc<NodeList>(); in demangleArrayType() local
[all …]
|
| /third_party/googletest/googletest/samples/ |
| D | sample3_unittest.cc | 102 for (const QueueNode<int>*n1 = q->Head(), *n2 = new_q->Head(); in MapTester()
|