| /llvm-project/compiler-rt/lib/scudo/standalone/ |
| H A D | list.h | 21 // The intrusive list requires the member `Next` (and `Prev` if doubly linked
22 // list)` defined in the node type. The type of `Next`/`Prev` can be a pointer in IteratorBase()
31 template <class T, bool LinkWithPtr = isPointer<decltype(T::Next)>::value>
40 T *getNext(T *X) const { return X->Next; } in back()
41 void setNext(T *X, T *Next) const { X->Next = Next; } in back()
52 typename removeConst<decltype(T::Next)>::type, in end()
67 if (X->Next == getEndOfListVal()) in checkConsistency()
69 DCHECK_LT(X->Next, Siz in checkConsistency()
213 T *Next = X->Next; remove() local
[all...] |
| /llvm-project/bolt/lib/Passes/ |
| H A D | StackAllocationAnalysis.cpp | 61 BitVector Next = StateIn; in doKill() local
63 return Next; in doKill()
64 for (auto I = this->expr_begin(Next), E = this->expr_end(); I != E; ++I) { in doKill()
70 Next.reset(I.getBitVectorIndex()); in doKill()
82 return Next; in doKill()
98 BitVector Next = Cur; in computeNext() local
100 Next = doKill(Point, Next, Sz); in computeNext()
101 return Next; in computeNext()
104 Next.set(this->ExprToIdx[&Point]); in computeNext()
105 return Next; in computeNext()
[all …]
|
| /llvm-project/llvm/include/llvm/ADT/ |
| H A D | ilist_base.h | 22 static void insertBeforeImpl(node_base_type &Next, node_base_type &N) { in insertBeforeImpl() argument
23 node_base_type &Prev = *Next.getPrev(); in insertBeforeImpl()
24 N.setNext(&Next); in insertBeforeImpl()
27 Next.setPrev(&N); in insertBeforeImpl()
32 node_base_type *Next = N.getNext(); in removeImpl() local
33 Next->setPrev(Prev); in removeImpl()
34 Prev->setNext(Next); in removeImpl()
52 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
58 assert(&Next != &First && in transferBeforeImpl()
[all …]
|
| H A D | ilist_node_base.h | 22 NodeBase *Next = nullptr; variable
26 void setNext(NodeBase *Next) { this->Next = Next; } in setNext() argument
28 NodeBase *getNext() const { return Next; } in getNext()
36 NodeBase *Next = nullptr; variable
40 void setNext(NodeBase *Next) { this->Next = Next; } in setNext() argument
42 NodeBase *getNext() const { return Next; } in getNext()
|
| H A D | SparseMultiSet.h | 101 unsigned Next; member
103 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {} in SMSNode()
107 return Next == INVALID; in isTail()
159 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue() argument
161 Dense.push_back(SMSNode(V, Prev, Next)); in addValue()
167 unsigned NextFree = Dense[Idx].Next; in addValue()
170 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
179 Dense[Idx].Next = FreelistIdx; in makeTombstone()
250 unsigned Next() const { return SMS->Dense[Idx].Next; } in Next() function
253 void setNext(unsigned N) { SMS->Dense[Idx].Next = N; } in setNext()
[all …]
|
| /llvm-project/llvm/unittests/CodeGen/ |
| H A D | RegAllocScoreTest.cpp | 123 auto Next = MBB->end(); in TEST() local
124 Next = MBB->insertAfter(Next, createMockInlineAsm(*MF)); in TEST()
125 Next = MBB->insertAfter(Next, createMockDebug(*MF)); in TEST()
126 Next = MBB->insertAfter(Next, createMockKill(*MF)); in TEST()
151 auto Next = MBB1->end(); in TEST() local
152 Next = MBB1->insertAfter(Next, createMockCop in TEST()
[all...] |
| /llvm-project/clang/lib/AST/Interp/ |
| H A D | InterpBlock.cpp | |
| H A D | InterpStack.cpp | |
| /llvm-project/lldb/unittests/Utility/ |
| H A D | StringLexerTest.cpp | 17 l.Next(); in TEST()
19 l.Next(); in TEST()
20 l.Next(); in TEST()
32 l.Next(); in TEST()
39 l.Next(); in TEST()
40 l.Next(); in TEST()
67 l.Next(); in TEST()
71 l.Next(); in TEST()
72 l.Next(); in TEST()
73 l.Next(); in TEST()
[all …]
|
| /llvm-project/lldb/source/Utility/ |
| H A D | Environment.cpp | 18 char *Next = Result; in make_entry() local
20 Next = std::copy(Key.begin(), Key.end(), Next); in make_entry()
21 *Next++ = '='; in make_entry()
22 Next = std::copy(Value.begin(), Value.end(), Next); in make_entry()
23 *Next++ = '\0'; in make_entry()
31 char **Next = Data; in Envp() local
33 *Next++ = make_entry(KV.first(), KV.second); in Envp()
34 *Next++ = nullptr; in Envp()
|
| /llvm-project/libunwind/src/ |
| H A D | FrameHeaderCache.hpp | 37 CacheEntry *Next; member
59 Entries[i].Next = &Entries[i + 1]; in resetCache()
61 Entries[kCacheEntryCount - 1].Next = nullptr; in resetCache()
107 Previous->Next = Current->Next; in find()
108 Current->Next = MostRecentlyUsed; in find()
115 Current = Current->Next; in find()
127 Unused = Unused->Next; in add()
131 while (Current->Next != nullptr) { in add()
133 Current = Current->Next; in add()
135 Previous->Next = nullptr; in add()
[all …]
|
| /llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIPostRABundler.cpp | 143 MachineBasicBlock::instr_iterator Next; in runOnMachineFunction() local
147 for (auto I = B; I != E; I = Next) { in runOnMachineFunction()
148 Next = std::next(I); in runOnMachineFunction()
160 for (I = Next; I != E; I = Next) { in runOnMachineFunction()
161 Next = std::next(I); in runOnMachineFunction()
180 Next = std::next(BundleEnd); in runOnMachineFunction()
187 if (Next != E && Next->isKill()) { in runOnMachineFunction()
190 for (const MachineInstr &BundleMI : make_range(BundleStart, Next)) in runOnMachineFunction()
195 while (Next != E && Next->isKill()) { in runOnMachineFunction()
196 MachineInstr &Kill = *Next; in runOnMachineFunction()
[all …]
|
| /llvm-project/clang/lib/Format/ |
| H A D | TokenAnnotator.cpp | 94 const FormatToken *AttrTok = Tok.Next->Next; in isCppAttribute()
114 AttrTok = AttrTok->Next; in isCppAttribute()
195 const auto *Next = CurrentToken->Next; in parseAngle()
203 if (Next && Next->is(tok::greater) && in parseAngle()
206 Next->getStartOfNonWhitespace().getLocWithOffset(-1)) { in parseAngle()
210 (!Next || !Next in parseAngle()
467 FormatToken *Next = CurrentToken->Next; parseParens() local
1620 auto Next = CurrentToken->getNextNonComment(); consumeToken() local
3388 FormatToken *Next = Tok->getNextNonComment(); verilogGroupDecl() local
3681 __anon97a2a5fc0902(const FormatToken *Next) isFunctionDeclarationName() argument
3716 const auto *Next = Current.Next; isFunctionDeclarationName() local
3907 auto *Next = Tok->Next; calculateFormattingInformation() local
3927 const auto *Next = Tok->Next; calculateFormattingInformation() local
4994 const FormatToken *Next = Right.MatchingParen->getNextNonComment(); spaceRequiredBefore() local
5116 const FormatToken *Next = Right.getNextNonComment(); spaceRequiredBefore() local
5942 const FormatToken *Next = Right.getNextNonComment(); canBreakBefore() local
6177 auto Next = Right.Next; canBreakBefore() local
[all...] |
| H A D | FormatTokenSource.h | 115 int Next = successor(Position); variable
117 while (Tokens[Next]->is(tok::comment))
118 Next = successor(Next);
121 dbgToken(Next);
123 return Tokens[Next];
145 int Next = Tokens.size(); in insertTokens() local
149 for (int I = Next, E = Tokens.size(); I != E; ++I) in insertTokens()
155 Position = Next; in insertTokens()
167 int Next = Current + 1; in successor() local
168 auto it = Jumps.find(Next); in successor()
[all …]
|
| H A D | ObjCPropertyAttributeOrderFixer.cpp | 45 if (BeginTok == EndTok || BeginTok->Next == EndTok) in sortPropertyAttributes()
58 for (auto Tok = BeginTok; Tok != EndTok; Tok = Tok->Next) { in sortPropertyAttributes()
77 assert(Tok->Next); in sortPropertyAttributes()
78 if (Tok->Next->is(tok::equal)) { in sortPropertyAttributes()
79 Tok = Tok->Next; in sortPropertyAttributes()
80 assert(Tok->Next); in sortPropertyAttributes()
81 if (Tok->Next->isNot(tok::identifier)) { in sortPropertyAttributes()
85 Tok = Tok->Next; in sortPropertyAttributes()
161 const FormatToken *const PropertyTok = Tok->Next; in analyzeObjCPropertyDecl()
175 sortPropertyAttributes(SourceMgr, Fixes, LParenTok->Next, RParenTo in analyzeObjCPropertyDecl()
[all...] |
| H A D | UnwrappedLineFormatter.cpp | 24 const FormatToken *Next = Line.First->getNextNonComment(); in startsExternCBlock() local
25 const FormatToken *NextNext = Next ? Next->getNextNonComment() : nullptr; in startsExternCBlock()
26 return Line.startsWith(tok::kw_extern) && Next && Next->isStringLiteral() && in startsExternCBlock()
124 const auto *Next = RootToken.Next; in getIndentOffset() local
128 Next && Next->is(tok::colon)) { in getIndentOffset()
132 if (Next in getIndentOffset()
819 const FormatToken *Next = Tok->getNextNonComment(); tryMergeSimpleBlock() local
948 SmallVectorImpl<AnnotatedLine *>::const_iterator Next; global() member in clang::format::__anon76deacb70111::LineJoiner
[all...] |
| H A D | WhitespaceManager.cpp | 766 return Current->Next->SpacesRequiredBefore == SpacesRequiredBefore; in alignConsecutiveMacros()
957 !Changes[I].Tok->Next || Changes[I].Tok->Next->isTrailingComment(); in alignConsecutiveShortCaseStatements()
1030 for (FormatToken *Next = C.Tok->Next; Next; Next = Next->Next) { in alignConsecutiveDeclarations()
1031 if (Next in alignConsecutiveDeclarations()
1028 for (FormatToken *Next = C.Tok->Next; Next; Next = Next->Next) { alignConsecutiveDeclarations() local
1341 const auto *Next = CellIter; alignArrayInitializersRightJustified() local
1362 for (const auto *Next = CellIter->NextColumnElement; Next; alignArrayInitializersRightJustified() local
1383 for (const auto *Next = CellIter->NextColumnElement; Next; alignArrayInitializersRightJustified() local
1408 for (const auto *Next = CellIter; Next; Next = Next->NextColumnElement) { alignArrayInitializersLeftJustified() local
1428 for (const auto *Next = CellIter->NextColumnElement; Next; alignArrayInitializersLeftJustified() local
1448 for (const auto *Next = Cell.NextColumnElement; Next; isSplitCell() local
1493 if (const auto *Next = C.Tok->getNextNonComment(); getCells() local
[all...] |
| /llvm-project/llvm/lib/IR/ |
| H A D | Use.cpp | 19 std::swap(Next, RHS.Next); in swap()
23 if (Next) in swap()
24 Next->Prev = &Next; in swap()
27 if (RHS.Next) in swap()
28 RHS.Next->Prev = &RHS.Next; in swap()
|
| /llvm-project/clang-tools-extra/pseudo/lib/ |
| H A D | Disambiguate.cpp | |
| /llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGSort.cpp | 280 MachineBasicBlock *Next = nullptr; in sortBlocks()
282 Next = Preferred.top(); in sortBlocks()
287 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
288 Entries.back().Deferred.push_back(Next); in sortBlocks()
289 Next = nullptr; in sortBlocks()
292 // If Next was originally ordered before MBB, and it isn't because it was in sortBlocks()
294 if (Next->getNumber() < MBB->getNumber() && in sortBlocks()
295 (WasmDisableEHPadSort || !Next->isEHPad()) && in sortBlocks()
296 (!R || !R->contains(Next) || in sortBlocks()
297 R->getHeader()->getNumber() < Next in sortBlocks()
281 MachineBasicBlock *Next = nullptr; sortBlocks() local
[all...] |
| /llvm-project/llvm/include/llvm/IR/ |
| H A D | Use.h | 82 Use *getNext() const { return Next; } in getNext()
94 Use *Next = nullptr; variable
99 Next = *List; in addToList()
100 if (Next) in addToList()
101 Next->Prev = &Next; in addToList()
107 *Prev = Next; in removeFromList()
108 if (Next) in removeFromList()
109 Next->Prev = Prev; in removeFromList()
|
| H A D | Value.h | 844 Use **Next = &Merged; in mergeUseLists()
848 *Next = R; in mergeUseLists()
852 *Next = L; in mergeUseLists()
856 *Next = R; in mergeUseLists()
857 Next = &R->Next; in mergeUseLists()
858 R = R->Next; in mergeUseLists()
860 *Next = L; in mergeUseLists()
861 Next = &L->Next; in mergeUseLists()
840 Use **Next = &Merged; mergeUseLists() local
912 Use *Next = UseList->Next; sortUseList() local
[all...] |
| /llvm-project/clang/lib/APINotes/ |
| H A D | APINotesReader.cpp | 848 llvm::BitstreamEntry Next = MaybeNext.get(); in readIdentifierBlock()
850 while (Next.Kind != llvm::BitstreamEntry::EndBlock) { in readIdentifierBlock()
851 if (Next.Kind == llvm::BitstreamEntry::Error) in readIdentifierBlock()
854 if (Next.Kind == llvm::BitstreamEntry::SubBlock) { in readIdentifierBlock()
866 Next = MaybeNext.get(); in readIdentifierBlock()
873 Cursor.readRecord(Next.ID, Scratch, &BlobData); in readIdentifierBlock()
916 Next = MaybeNext.get(); in readObjCContextBlock()
933 llvm::BitstreamEntry Next = MaybeNext.get(); in readObjCContextBlock()
935 while (Next.Kind != llvm::BitstreamEntry::EndBlock) { in readObjCContextBlock()
936 if (Next in readObjCContextBlock()
759 llvm::BitstreamEntry Next = MaybeNext.get(); readControlBlock() local
844 llvm::BitstreamEntry Next = MaybeNext.get(); readIdentifierBlock() local
920 llvm::BitstreamEntry Next = MaybeNext.get(); readObjCContextBlock() local
1011 llvm::BitstreamEntry Next = MaybeNext.get(); readObjCPropertyBlock() local
1088 llvm::BitstreamEntry Next = MaybeNext.get(); readObjCMethodBlock() local
1163 llvm::BitstreamEntry Next = MaybeNext.get(); readObjCSelectorBlock() local
1239 llvm::BitstreamEntry Next = MaybeNext.get(); readGlobalVariableBlock() local
1315 llvm::BitstreamEntry Next = MaybeNext.get(); readGlobalFunctionBlock() local
1391 llvm::BitstreamEntry Next = MaybeNext.get(); readEnumConstantBlock() local
1467 llvm::BitstreamEntry Next = MaybeNext.get(); readTagBlock() local
1542 llvm::BitstreamEntry Next = MaybeNext.get(); readTypedefBlock() local
[all...] |
| /llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_segmented_array.h | 36 Segment *Next; member
106 DCHECK_NE(S->Next, &SentinelSegment);
107 S = S->Next;
233 Freelist = Freelist->Next; in NewSegment()
242 FreeSegment->Next = &SentinelSegment; in NewSegment()
267 DCHECK_EQ(S->Next, &SentinelSegment); in InitHeadAndTail()
273 DCHECK_EQ(Tail->Next, &SentinelSegment); in InitHeadAndTail()
283 DCHECK_EQ(Tail->Next, &SentinelSegment); in AppendNewSegment()
285 DCHECK_EQ(S->Next, &SentinelSegment); in AppendNewSegment()
287 Tail->Next = S; in AppendNewSegment()
[all …]
|
| /llvm-project/llvm/lib/DWARFLinker/Parallel/ |
| H A D | ArrayList.h | 49 if (!CurGroup->Next) in add()
50 allocateNewGroup(CurGroup->Next); in add()
52 LastGroup.compare_exchange_weak(CurGroup, CurGroup->Next); in add()
65 CurGroup = CurGroup->Next) { in forEach()
97 CurGroup = CurGroup->Next) in size()
111 std::atomic<ItemsGroup *> Next = nullptr; member
137 NewGroup->Next = nullptr; in allocateNewGroup()
145 ItemsGroup *NextGroup = CurGroup->Next; in allocateNewGroup()
148 if (CurGroup->Next.compare_exchange_weak(NextGroup, NewGroup)) in allocateNewGroup()
|