Home
last modified time | relevance | path

Searched refs:Next (Results 1 – 25 of 485) sorted by relevance

12345678910>>...20

/llvm-project-15.0.7/clang/lib/Format/
H A DQualifierAlignmentFixer.cpp130 FormatToken *Next = First->Next; in insertQualifierAfter() local
283 Next = Next->Next; in analyzeRight()
285 Next = Next->MatchingParen; in analyzeRight()
293 Next = Next->Next; in analyzeRight()
334 if (Tok->Next->Next && Tok->Next->Next->isOneOf(tok::identifier, tok::star, in analyzeLeft()
351 Tok->Next->Next && Tok->Next->Next->is(QualifierType)) { in analyzeLeft()
364 Next = Next->Next; in analyzeLeft()
365 if (Next && Next->Previous && in analyzeLeft()
379 Next = Next->Next; in analyzeLeft()
384 Next = Next->Next->Next; in analyzeLeft()
[all …]
H A DTokenAnnotator.cpp1188 (Tok->Next && Tok->Next->is(tok::identifier) && Tok->Next->Next && in consumeToken()
1495 Tok.Next->Next->Next && Tok.Next->Next->Next->is(tok::l_paren); in isClosureImportStatement()
2714 for (; Next; Next = Next->Next) { in isFunctionDeclarationName()
2723 Next = Next->Next->Next; in isFunctionDeclarationName()
2729 Next = Next->Next; in isFunctionDeclarationName()
2735 Next = Next->Next; in isFunctionDeclarationName()
2757 for (; Next; Next = Next->Next) { in isFunctionDeclarationName()
2761 Next = Next->Next; in isFunctionDeclarationName()
2765 Next = skipOperatorName(Next->Next); in isFunctionDeclarationName()
2784 if (Next->Next == Next->MatchingParen) in isFunctionDeclarationName()
[all …]
H A DWhitespaceManager.h297 for (const auto *Next = CellIter->NextColumnElement; Next != nullptr; in getMaximumCellWidth() local
298 Next = Next->NextColumnElement) { in getMaximumCellWidth()
299 auto ThisWidth = calculateCellWidth(Next->Index, Next->EndIndex, true); in getMaximumCellWidth()
300 if (Changes[Next->Index].NewlinesBefore == 0) in getMaximumCellWidth()
315 for (const auto *Next = CellStop->NextColumnElement; Next != nullptr; in getMaximumNetWidth() local
316 Next = Next->NextColumnElement) { in getMaximumNetWidth()
H A DWhitespaceManager.cpp865 for (FormatToken *Next = C.Tok->Next; Next; Next = Next->Next) { in alignConsecutiveDeclarations() local
1119 Next = Next->NextColumnElement; in alignArrayInitializersRightJustified()
1120 } while (Next); in alignArrayInitializersRightJustified()
1134 Next = Next->NextColumnElement) { in alignArrayInitializersRightJustified()
1152 for (const auto *Next = CellIter->NextColumnElement; Next != nullptr; in alignArrayInitializersRightJustified() local
1153 Next = Next->NextColumnElement) { in alignArrayInitializersRightJustified()
1160 alignToStartOfCell(Next->Index, Next->EndIndex); in alignArrayInitializersRightJustified()
1194 for (const auto *Next = CellIter->NextColumnElement; Next != nullptr; in alignArrayInitializersLeftJustified() local
1195 Next = Next->NextColumnElement) { in alignArrayInitializersLeftJustified()
1214 for (const auto *Next = Cell.NextColumnElement; Next != nullptr; in isSplitCell() local
[all …]
H A DUnwrappedLineFormatter.cpp24 const FormatToken *NextNext = Next ? Next->getNextNonComment() : nullptr; in startsExternCBlock()
25 return Line.startsWith(tok::kw_extern) && Next && Next->isStringLiteral() && in startsExternCBlock()
118 RootToken.Next && RootToken.Next->is(tok::colon))) { in getIndentOffset()
123 RootToken.Next->Next && RootToken.Next->Next->is(tok::colon)) { in getIndentOffset()
208 if (Next == End) in getNextMergedLine()
222 join(*Next[0], *Next[i + 1]); in getNextMergedLine()
223 Next = Next + MergedLines + 1; in getNextMergedLine()
703 (Line.First->Next && Line.First->Next->is(tok::kw_else))) { in tryMergeSimpleBlock()
769 return !Next || Next->is(tok::semi); in tryMergeSimpleBlock()
807 if (Tok->Next && Tok->Next->is(tok::kw_else)) in tryMergeSimpleBlock()
[all …]
/llvm-project-15.0.7/clang/lib/AST/Interp/
H A DInterpBlock.cpp26 P->Next = Pointers; in addPointer()
35 Pointers = P->Next; in removePointer()
37 P->Prev->Next = P->Next; in removePointer()
38 if (P->Next) in removePointer()
53 To->Next = From->Next; in movePointer()
54 if (To->Next) in movePointer()
69 Next = Root; in DeadBlock()
81 Prev->Next = Next; in free()
82 if (Next) in free()
83 Next->Prev = Prev; in free()
[all …]
H A DInterpStack.cpp21 if (Chunk && Chunk->Next) in clear()
22 free(Chunk->Next); in clear()
33 if (Chunk && Chunk->Next) { in grow()
34 Chunk = Chunk->Next; in grow()
36 StackChunk *Next = new (malloc(ChunkSize)) StackChunk(Chunk); in grow() local
38 Chunk->Next = Next; in grow()
39 Chunk = Next; in grow()
67 if (Chunk->Next) { in shrink()
68 free(Chunk->Next); in shrink()
69 Chunk->Next = nullptr; in shrink()
/llvm-project-15.0.7/compiler-rt/lib/scudo/standalone/
H A Dlist.h88 X->Next = nullptr; in push_back()
92 Last->Next = X; in push_back()
100 X->Next = First; in push_front()
118 Prev->Next = X->Next; in extract()
153 X->Next = First; in push_front()
166 Prev->Next = X; in insert()
168 X->Next = Y; in insert()
201 T *Next = X->Next; in remove() local
204 Prev->Next = Next; in remove()
206 if (Next) { in remove()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A Dilist_base.h23 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()
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
58 assert(&Next != &First && in transferBeforeImpl()
70 Final.setNext(&Next); in transferBeforeImpl()
73 Next.setPrev(&Final); in transferBeforeImpl()
[all …]
H A Dilist_node_base.h23 ilist_node_base *Next = nullptr; variable
27 void setNext(ilist_node_base *Next) { this->Next = Next; } in setNext() argument
29 ilist_node_base *getNext() const { return Next; } in getNext()
37 ilist_node_base *Next = nullptr; variable
41 void setNext(ilist_node_base *Next) { this->Next = Next; } in setNext() argument
43 ilist_node_base *getNext() const { return Next; } in getNext()
H A DSparseMultiSet.h102 unsigned Next; member
108 return Next == INVALID; in isTail()
180 Dense[Idx].Next = FreelistIdx; in makeTombstone()
251 unsigned Next() const { return SMS->Dense[Idx].Next; } in Next() function
297 Idx = Next();
436 Dense[TailIdx].Next = NodeIdx; in insert()
499 Sparse[sparseIndex(N)] = N.Next; in unlink()
500 Dense[N.Next].Prev = N.Prev; in unlink()
507 Dense[N.Prev].Next = N.Next; in unlink()
515 Dense[N.Next].Prev = N.Prev; in unlink()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DStackAllocationAnalysis.cpp63 return Next; in doKill()
82 return Next; in doKill()
100 Next = doKill(Point, Next, Sz); in computeNext()
101 return Next; in computeNext()
105 return Next; in computeNext()
116 Next = doKill(Point, Next, FPOffset - SPOffset); in computeNext()
117 return Next; in computeNext()
121 return Next; in computeNext()
138 return Next; in computeNext()
141 Next = doKill(Point, Next, Output - SPOffset); in computeNext()
[all …]
/llvm-project-15.0.7/llvm/unittests/CodeGen/
H A DRegAllocScoreTest.cpp123 Next = MBB->insertAfter(Next, createMockInlineAsm(*MF)); in TEST()
124 Next = MBB->insertAfter(Next, createMockDebug(*MF)); in TEST()
125 Next = MBB->insertAfter(Next, createMockKill(*MF)); in TEST()
151 Next = MBB1->insertAfter(Next, createMockCopy(*MF)); in TEST()
152 Next = MBB1->insertAfter(Next, createMockLoad(*MF)); in TEST()
153 Next = MBB1->insertAfter(Next, createMockLoad(*MF)); in TEST()
154 Next = MBB1->insertAfter(Next, createMockStore(*MF)); in TEST()
157 Next = MBB2->end(); in TEST()
158 Next = MBB2->insertAfter(Next, createMockLoad(*MF)); in TEST()
159 Next = MBB2->insertAfter(Next, createMockStore(*MF)); in TEST()
[all …]
/llvm-project-15.0.7/lldb/unittests/Utility/
H A DStringLexerTest.cpp17 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-15.0.7/lldb/source/Utility/
H A DEnvironment.cpp18 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-15.0.7/libunwind/src/
H A DFrameHeaderCache.hpp37 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-15.0.7/llvm/lib/IR/
H A DUse.cpp19 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-15.0.7/llvm/lib/Target/AMDGPU/
H A DSIPostRABundler.cpp134 MachineBasicBlock::instr_iterator Next; in runOnMachineFunction() local
138 for (auto I = B; I != E; I = Next) { in runOnMachineFunction()
139 Next = std::next(I); in runOnMachineFunction()
151 for (I = Next; I != E; I = Next) { in runOnMachineFunction()
152 Next = std::next(I); in runOnMachineFunction()
171 Next = std::next(BundleEnd); in runOnMachineFunction()
178 if (Next != E && Next->isKill()) { in runOnMachineFunction()
186 while (Next != E && Next->isKill()) { in runOnMachineFunction()
187 MachineInstr &Kill = *Next; in runOnMachineFunction()
197 ++Next; in runOnMachineFunction()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DUse.h82 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 DValue.h830 *Next = R; in mergeUseLists()
834 *Next = L; in mergeUseLists()
838 *Next = R; in mergeUseLists()
839 Next = &R->Next; in mergeUseLists()
842 *Next = L; in mergeUseLists()
843 Next = &L->Next; in mergeUseLists()
898 Use *Next = UseList->Next; in sortUseList() local
904 while (Next->Next) { in sortUseList()
906 Next = Current->Next; in sortUseList()
936 assert(!Next->Next && "Expected only one Use"); in sortUseList()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp281 MachineBasicBlock *Next = nullptr; in sortBlocks() local
283 Next = Preferred.top(); in sortBlocks()
289 Entries.back().Deferred.push_back(Next); in sortBlocks()
290 Next = nullptr; in sortBlocks()
297 (!R || !R->contains(Next) || in sortBlocks()
299 Ready.push(Next); in sortBlocks()
300 Next = nullptr; in sortBlocks()
307 if (!Next) { in sortBlocks()
314 Next = Ready.top(); in sortBlocks()
327 Next->moveAfter(MBB); in sortBlocks()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/xray/
H A Dxray_segmented_array.h36 Segment *Next; member
108 S = S->Next;
234 Freelist = Freelist->Next; in NewSegment()
268 DCHECK_EQ(S->Next, &SentinelSegment); in InitHeadAndTail()
288 Tail->Next = S; in AppendNewSegment()
290 DCHECK_EQ(S, S->Prev->Next); in AppendNewSegment()
419 S = S->Next;
557 SPT->Next = &SentinelSegment; in trim()
559 Tail->Next = Freelist; in trim()
599 ST->Next = Freelist; in trim()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Scalar/
H A DGVN.h237 LeaderTableEntry *Next;
278 Node->Next = Curr.Next;
279 Curr.Next = Node;
290 Curr = Curr->Next;
297 Prev->Next = Curr->Next;
299 if (!Curr->Next) {
303 LeaderTableEntry *Next = Curr->Next;
304 Curr->Val = Next->Val;
305 Curr->BB = Next->BB;
306 Curr->Next = Next->Next;
/llvm-project-15.0.7/llvm/tools/llvm-c-test/
H A Decho.cpp925 Cur = Next; in CloneBB()
956 Cur = Next; in CloneBBs()
996 Cur = Next; in declare_symbols()
1009 Next = nullptr; in declare_symbols()
1042 Cur = Next; in declare_symbols()
1078 Cur = Next; in declare_symbols()
1113 Cur = Next; in declare_symbols()
1200 Cur = Next; in clone_symbols()
1254 Cur = Next; in clone_symbols()
1293 Cur = Next; in clone_symbols()
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DManagedStatic.cpp40 Next = StaticList; in RegisterManagedStatic()
44 assert(!Ptr && !DeleterFn && !Next && in RegisterManagedStatic()
50 Next = StaticList; in RegisterManagedStatic()
60 StaticList = Next; in destroy()
61 Next = nullptr; in destroy()

12345678910>>...20