Home
last modified time | relevance | path

Searched refs:Head (Results 1 - 25 of 69) sorted by relevance

123

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/
H A DMicrosoftDemangle.h39 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()
54 Head = Next; in ~ArenaAllocator()
59 assert(Head && Head in allocUnalignedBuffer()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp70 // Triangle: Head Diamond: Head
79 // Head block, and phis in the Tail block are converted to select instructions.
89 MachineBasicBlock *Head; member in __anon24002::SSAIfConv
105 MachineBasicBlock *getTPred() const { return TBB == Tail ? Head : TBB; } in getTPred()
108 MachineBasicBlock *getFPred() const { return FBB == Tail ? Head : FBB; } in getFPred()
127 /// Instructions in Head that define values used by the conditional blocks.
137 /// Insertion point in Head for speculatively executed instructions form TBB
157 /// Find a valid insertion point in Head.
244 // Check for any dependencies on Head instruction in canSpeculateInstrs()
[all...]
H A DMachineRegisterInfo.cpp268 MachineOperand *const Head = HeadRef; in addRegOperandToUseList() local
270 // Head points to the first list element. in addRegOperandToUseList()
272 // Prev pointers are circular, so Head->Prev == Last. in addRegOperandToUseList()
274 // Head is NULL for an empty list. in addRegOperandToUseList()
275 if (!Head) { in addRegOperandToUseList()
281 assert(MO->getReg() == Head->getReg() && "Different regs on the same list!"); in addRegOperandToUseList()
283 // Insert MO between Last and Head in the circular Prev chain. 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; removeRegOperandFromUseList() local
352 MachineOperand *&Head = getRegUseDefListHead(Src->getReg()); moveOperands() local
[all...]
H A DShadowStackGCLowering.cpp54 GlobalVariable *Head = nullptr; member in __anon24124::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()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64ConditionalCompares.cpp59 STATISTIC(NumHeadBranchRejs, "Number of ccmps rejected (Head branch)");
84 // From: Head To: Head
94 // The Head block is terminated by a br.cond instruction, and the CmpBB block
98 // compare, and merges CmpBB into Head, speculatively executing its
109 // Head:
121 // Head:
129 // The ccmp condition code is the one that would cause the Head terminator to
133 // between Head and Tail, just like if-converting a diamond.
148 MachineBasicBlock *Head; member in __anon24368::SSACCmpConv
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DScoreboardHazardRecognizer.h34 // indicated by Head.
48 size_t Head = 0; member in llvm::ScoreboardHazardRecognizer::Scoreboard
64 return Data[(Head + idx) & (Depth-1)]; in operator []()
74 Head = 0; in reset()
78 Head = (Head + 1) & (Depth-1); in advance()
82 Head = (Head - 1) & (Depth-1); in recede()
H A DMachineTraceMetrics.h165 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/
H A DAutomaton.h98 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 in getPaths()
[all...]
H A DRegistry.h56 static node *Head, *Tail; member in llvm::Registry
131 /// This provides template definitions of add_node, begin, and the Head and Tail
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; \
H A DOnDiskHashTable.h82 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/lzma/CPP/7zip/Common/
H A DMultiOutStream.h55 int Head; // newest variable
60 Head = -1; in InitLinkedList()
69 node.Next = Head; in InsertToLinkedList()
72 if (Head != -1) in InsertToLinkedList()
73 Streams[(unsigned)Head].Prev = (int)index; in InsertToLinkedList()
79 Head = (int)index; in InsertToLinkedList()
87 if (s.Prev != -1) Streams[(unsigned)s.Prev].Next = s.Next; else Head = s.Next; in RemoveFromLinkedList()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcordz_info_test.cc72 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(snapsho in TEST()
[all...]
/third_party/benchmark/src/
H A Dbenchmark_name.cc24 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/lib/Support/
H A DPrettyStackTrace.cpp63 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/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DImmutableList.h30 T Head; member in llvm::ImmutableListImpl
35 : Head(std::forward<ElemT>(head)), Tail(tail) {} in ImmutableListImpl()
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()
H A DBreadthFirstIterator.h78 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/lzma/CPP/7zip/UI/Common/
H A DArchiveOpenCallback.cpp137 s.Next = Head;
140 if (Head != -1)
141 Streams[(unsigned)Head].Prev = (int)index;
147 Head = (int)index;
155 if (s.Prev != -1) Streams[(unsigned)s.Prev].Next = s.Next; else Head = s.Next;
180 Head = -1;
187 Head(-1),
214 if ((int)index != Head)
/third_party/googletest/googletest/include/gtest/internal/
H A Dgtest-type-util.h134 using Head = TemplateSel<Head_>;
140 using Head = TemplateSel<Head_>;
147 using Head = Head_;
153 using Head = Head_;
/third_party/skia/third_party/externals/abseil-cpp/absl/types/internal/
H A Dconformance_testing_helpers.h139 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/googletest/include/gtest/internal/
H A Dgtest-type-util.h164 using Head = TemplateSel<Head_>;
170 using Head = TemplateSel<Head_>;
177 using Head = Head_;
183 using Head = Head_;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp931 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()
959 // Head dominates ThenBlock. in SplitBlockAndInsertIfThen()
961 DT->addNewBlock(ThenBlock, Head); in SplitBlockAndInsertIfThen()
963 DT->changeImmediateDominator(ThenBlock, Head); in SplitBlockAndInsertIfThen()
981 BasicBlock *Head = SplitBefore->getParent(); SplitBlockAndInsertIfThenElse() local
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dhash_forgetful_chain_inc.h71 static uint16_t* FN(Head)(void* extra) { in Head() function
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in TinyHash()
96 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in Prepare()
134 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in Store()
200 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FindLongestMatch()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_forgetful_chain_inc.h71 static uint16_t* FN(Head)(void* extra) { in Head() function
76 return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]); in TinyHash()
96 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in Prepare()
134 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in Store()
200 uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra); in FindLongestMatch()
/third_party/googletest/googletest/samples/
H A Dsample3_unittest.cc99 for (const QueueNode<int>*n1 = q->Head(), *n2 = new_q->Head(); in MapTester()
/third_party/skia/tools/
H A DRegistry.h39 static const Registry* Head() { return gHead; } in Head() function in sk_tools::Registry
52 Iterator begin() const { return Iterator{Registry::Head()}; } in begin()

Completed in 15 milliseconds

123