Home
last modified time | relevance | path

Searched refs:Curr (Results 1 – 25 of 34) sorted by relevance

12

/llvm-project-15.0.7/clang/lib/ARCMigrate/
H A DTransProtectedScope.cpp65 if (!Curr) in VisitSwitchStmt()
67 Stmt *Parent = getCaseParent(Curr); in VisitSwitchStmt()
68 Curr = Curr->getNextSwitchCase(); in VisitSwitchStmt()
70 while (Curr) { in VisitSwitchStmt()
71 if (getCaseParent(Curr) != Parent) in VisitSwitchStmt()
73 Curr = Curr->getNextSwitchCase(); in VisitSwitchStmt()
77 Curr = S->getSwitchCaseList(); in VisitSwitchStmt()
79 while (Curr) { in VisitSwitchStmt()
81 CaseInfo(Curr, SourceRange(Curr->getBeginLoc(), NextLoc))); in VisitSwitchStmt()
82 NextLoc = Curr->getBeginLoc(); in VisitSwitchStmt()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Scalar/
H A DGVN.h269 if (!Curr.Val) {
270 Curr.Val = V;
271 Curr.BB = BB;
278 Node->Next = Curr.Next;
279 Curr.Next = Node;
288 while (Curr && (Curr->Val != I || Curr->BB != BB)) {
289 Prev = Curr;
290 Curr = Curr->Next;
293 if (!Curr)
299 if (!Curr->Next) {
[all …]
/llvm-project-15.0.7/llvm/lib/DebugInfo/GSYM/
H A DLineTable.cpp201 for (const auto &Curr : Lines) { in encode() local
202 if (Curr.Addr < BaseAddr) in encode()
207 if (Curr.Addr < Prev.Addr) in encode()
210 const uint64_t AddrDelta = Curr.Addr - Prev.Addr; in encode()
212 if (Curr.Line > Prev.Line) in encode()
213 LineDelta = Curr.Line - Prev.Line; in encode()
214 else if (Prev.Line > Curr.Line) in encode()
215 LineDelta = -((int32_t)(Prev.Line - Curr.Line)); in encode()
218 if (Curr.File != Prev.File) { in encode()
220 Out.writeULEB(Curr.File); in encode()
[all …]
H A DGsymCreator.cpp178 FirstIt = std::find_if(FirstIt, LastIt, [&](const auto &Curr) { in removeIfBinary() argument
179 return Pred(*PrevIt++, Curr); in removeIfBinary()
226 [&](const auto &Prev, const auto &Curr) { in finalize() argument
230 const bool ranges_equal = Prev.Range == Curr.Range; in finalize()
231 if (ranges_equal || Prev.Range.intersects(Curr.Range)) { in finalize()
240 if (Prev == Curr) { in finalize()
250 if (!Prev.hasRichInfo() && Curr.hasRichInfo()) { in finalize()
261 << Curr << "\n"; in finalize()
270 << Curr << "\n"; in finalize()
274 Curr.Range.contains(Prev.Range.start())) { in finalize()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DMemoryProfileInfo.cpp103 CallStackTrieNode *Curr = nullptr; in addCallStack() local
115 Curr = Alloc; in addCallStack()
119 auto Next = Curr->Callers.find(StackId); in addCallStack()
120 if (Next != Curr->Callers.end()) { in addCallStack()
121 Curr = Next->second; in addCallStack()
122 Curr->AllocTypes |= static_cast<uint8_t>(AllocType); in addCallStack()
127 Curr->Callers[StackId] = New; in addCallStack()
128 Curr = New; in addCallStack()
130 assert(Curr); in addCallStack()
H A DIRSimilarityIdentifier.cpp537 for (unsigned &Curr : ValueMappingIt->second) in checkNumberingAndReplaceCommutative() local
539 if (TargetValueNumbers.contains(Curr)) in checkNumberingAndReplaceCommutative()
540 NewSet.insert(Curr); in checkNumberingAndReplaceCommutative()
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/
H A DConfusableIdentifierCheck.cpp56 const char *Curr = SName.c_str(); in skeleton() local
57 const char *End = Curr + SName.size(); in skeleton()
58 while (Curr < End) { in skeleton()
60 const char *Prev = Curr; in skeleton()
63 reinterpret_cast<const UTF8 **>(&Curr), in skeleton()
70 StringRef Key(Prev, Curr - Prev); in skeleton()
76 Skeleton.append(Prev, Curr); in skeleton()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DSuffixTree.h267 SuffixTreeNode *Curr = ToVisit.back(); in advance() local
273 unsigned Length = Curr->ConcatLen; in advance()
278 for (auto &ChildPair : Curr->Children) { in advance()
291 if (Curr->isRoot()) in advance()
297 N = Curr; in advance()
H A DScopedPrinter.h191 uint64_t Curr = Value; in printFlags() local
192 while (Curr > 0) { in printFlags()
193 if (Curr & 1) in printFlags()
195 Curr >>= 1; in printFlags()
/llvm-project-15.0.7/llvm/test/Analysis/LoopAccessAnalysis/
H A Dunderlying-objects-2.ll15 ; Curr = A[0]; // Prev_0
17 ; Prev = Curr; // Prev = PHI (Prev_0, Curr)
18 ; Curr = A[i];
20 ; Curr[j] = Prev[j] * B[j]
26 ; should not assume that Curr and Prev share the same underlying object.
28 ; If it did we would try to dependence-analyze Curr and Prev and the analysis
/llvm-project-15.0.7/clang/tools/driver/
H A Dcc1_main.cpp122 size_t Curr = getCurrentStackAllocation(); in ensureStackAddressSpace() local
124 if (Curr < kTargetStack) { in ensureStackAddressSpace()
126 static_cast<volatile char *>(alloca(kTargetStack - Curr)); in ensureStackAddressSpace()
128 Alloc[kTargetStack - Curr - 1] = 0; in ensureStackAddressSpace()
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCBoolRetToInt.cpp78 Value *Curr = WorkList.pop_back_val(); in findAllDefs() local
79 auto *CurrUser = dyn_cast<User>(Curr); in findAllDefs()
82 if (CurrUser && !isa<CallInst>(Curr) && !isa<Constant>(Curr)) in findAllDefs()
/llvm-project-15.0.7/llvm/lib/Support/Windows/
H A DThreading.inc157 for (auto *Curr = Info; Curr < End;
158 Curr = (SYSTEM_LOGICAL_PROCESSOR_INFORMATION_EX *)((uint8_t *)Curr +
159 Curr->Size)) {
160 if (Curr->Relationship != Relationship)
162 Fn(Curr);
/llvm-project-15.0.7/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp97 Value *Curr = Worklist.back(); in buildTruncExpressionGraph() local
99 if (isa<Constant>(Curr)) { in buildTruncExpressionGraph()
104 auto *I = dyn_cast<Instruction>(Curr); in buildTruncExpressionGraph()
192 Value *Curr = Worklist.back(); in getMinBitWidth() local
194 if (isa<Constant>(Curr)) { in getMinBitWidth()
200 auto *I = cast<Instruction>(Curr); in getMinBitWidth()
/llvm-project-15.0.7/llvm/tools/llvm-stress/
H A Dllvm-stress.cpp720 BasicBlock *Curr = Instr->getParent(); in IntroduceControlFlow() local
722 BasicBlock *Next = Curr->splitBasicBlock(Loc, "CF"); in IntroduceControlFlow()
723 Instr->moveBefore(Curr->getTerminator()); in IntroduceControlFlow()
724 if (Curr != &F->getEntryBlock()) { in IntroduceControlFlow()
725 BranchInst::Create(Curr, Next, Instr, Curr->getTerminator()); in IntroduceControlFlow()
726 Curr->getTerminator()->eraseFromParent(); in IntroduceControlFlow()
/llvm-project-15.0.7/llvm/tools/obj2yaml/
H A Dmacho2yaml.cpp172 const SectionType *Curr = in extractSections() local
174 for (; reinterpret_cast<const void *>(Curr) < End; Curr++) { in extractSections()
176 memcpy((void *)&Sec, Curr, sizeof(SectionType)); in extractSections()
202 return reinterpret_cast<const char *>(Curr); in extractSections()
280 auto Curr = Start + i * sizeof(MachO::build_tool_version); in processLoadCommandData() local
282 memcpy((void *)&BV, Curr, sizeof(MachO::build_tool_version)); in processLoadCommandData()
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/modernize/
H A DLoopConvertUtils.cpp82 const Stmt *Curr = DeclParents->lookup(V); in VisitVarDecl() local
84 while (Curr != nullptr) { in VisitVarDecl()
85 if (Curr == ContainingStmt) { in VisitVarDecl()
89 Curr = StmtParents->lookup(Curr); in VisitVarDecl()
/llvm-project-15.0.7/llvm/lib/ObjCopy/MachO/
H A DMachOReader.cpp64 for (auto Curr = reinterpret_cast<const SectionType *>(LoadCmd.Ptr + in extractSections() local
68 Curr < End; ++Curr) { in extractSections()
70 memcpy((void *)&Sec, Curr, sizeof(SectionType)); in extractSections()
/llvm-project-15.0.7/llvm/lib/DebugInfo/DWARF/
H A DDWARFVerifier.cpp272 DWARFDie Curr = Die.getParent(); in verifyDebugInfoCallSite() local
273 for (; Curr.isValid() && !Curr.isSubprogramDIE(); Curr = Die.getParent()) { in verifyDebugInfoCallSite()
274 if (Curr.getTag() == DW_TAG_inlined_subroutine) { in verifyDebugInfoCallSite()
276 Curr.dump(OS); in verifyDebugInfoCallSite()
281 if (!Curr.isValid()) { in verifyDebugInfoCallSite()
288 Curr.find({DW_AT_call_all_calls, DW_AT_call_all_source_calls, in verifyDebugInfoCallSite()
294 Curr.dump(OS); in verifyDebugInfoCallSite()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSparseBitVector.h148 int find_next(unsigned Curr) const { in find_next()
149 if (Curr >= BITS_PER_ELEMENT) in find_next()
152 unsigned WordPos = Curr / BITWORD_SIZE; in find_next()
153 unsigned BitPos = Curr % BITWORD_SIZE; in find_next()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLoopDistribute.cpp483 for (auto Curr = PartitionContainer.cbegin(), in cloneLoops() local
486 Next != E; ++Curr, ++Next) in cloneLoops()
489 Curr->getDistributedLoop()->getExitingBlock()); in cloneLoops()
H A DEarlyCSE.cpp1090 Instruction *Curr = WorkList.pop_back_val(); in handleBranchCondition() local
1092 AvailableValues.insert(Curr, TorF); in handleBranchCondition()
1094 << Curr->getName() << "' as " << *TorF << " in " in handleBranchCondition()
1100 if (unsigned Count = replaceDominatedUsesWith(Curr, TorF, DT, in handleBranchCondition()
1108 if (MatchBinOp(Curr, PropagateOpcode, LHS, RHS)) in handleBranchCondition()
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dx86-cmov-converter.ll82 ;;unsigned BinarySearch(unsigned Mask, Node *Curr, Node *Next) {
83 ;; while (Curr->Val > Next->Val) {
84 ;; Curr = Next;
85 ;; if (Mask & (0x1 << Curr->Val))
86 ;; Next = Curr->Right;
88 ;; Next = Curr->Left;
90 ;; return Curr->Val;
516 define i32 @BinarySearch(i32 %Mask, ptr nocapture readonly %Curr, ptr nocapture readonly %Next) #0 {
555 %0 = load i32, ptr %Curr, align 8
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DCodeExtractor.cpp102 User const *Curr = ToVisit.pop_back_val(); in isBlockValidForExtraction() local
103 if (!Visited.insert(Curr).second) in isBlockValidForExtraction()
105 if (isa<BlockAddress const>(Curr)) in isBlockValidForExtraction()
108 if (isa<Instruction>(Curr) && cast<Instruction>(Curr)->getParent() != &BB) in isBlockValidForExtraction()
111 for (auto const &U : Curr->operands()) { in isBlockValidForExtraction()
/llvm-project-15.0.7/llvm/include/llvm/TableGen/
H A DRecord.h2020 const char *Curr = Start; in RecordParts() local
2021 bool IsDigitPart = isDigit(Curr[0]); in RecordParts()
2023 bool IsDigit = isDigit(Curr[I]); in RecordParts()
2027 Start = &Curr[I]; in RecordParts()
2028 IsDigitPart = isDigit(Curr[I]); in RecordParts()

12