Home
last modified time | relevance | path

Searched refs:Cur (Results 1 – 25 of 28) sorted by relevance

12

/NextBSD/contrib/llvm/include/llvm/Support/
HDRegistry.h74 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) in Announce() local
75 Cur->registered(E); in Announce()
109 const node *Cur; variable
112 explicit iterator(const node *N) : Cur(N) {} in iterator()
114 bool operator==(const iterator &That) const { return Cur == That.Cur; }
115 bool operator!=(const iterator &That) const { return Cur != That.Cur; }
116 iterator &operator++() { Cur = Cur->Next; return *this; }
117 const entry &operator*() const { return Cur->Val; }
118 const entry *operator->() const { return &Cur->Val; }
HDcircular_raw_ostream.h60 char *Cur; variable
77 TheStream->write(Cur, BufferArray + BufferSize - Cur); in flushBuffer()
79 TheStream->write(BufferArray, Cur - BufferArray); in flushBuffer()
80 Cur = BufferArray; in flushBuffer()
116 Cur = BufferArray; in raw_ostream()
/NextBSD/contrib/llvm/tools/clang/lib/AST/
HDTypeLoc.cpp171 TypeLoc Cur = *this; in getBeginLoc() local
172 TypeLoc LeftMost = Cur; in getBeginLoc()
174 switch (Cur.getTypeLocClass()) { in getBeginLoc()
176 LeftMost = Cur; in getBeginLoc()
179 if (Cur.castAs<FunctionProtoTypeLoc>().getTypePtr() in getBeginLoc()
181 LeftMost = Cur; in getBeginLoc()
192 Cur = Cur.getNextTypeLoc(); in getBeginLoc()
195 if (!Cur.getLocalSourceRange().getBegin().isInvalid()) in getBeginLoc()
196 LeftMost = Cur; in getBeginLoc()
197 Cur = Cur.getNextTypeLoc(); in getBeginLoc()
[all …]
HDType.cpp240 QualType Cur = T; in getSplitDesugaredType() local
242 const Type *CurTy = Qs.strip(Cur); in getSplitDesugaredType()
250 Cur = Ty->desugar(); \ in getSplitDesugaredType()
307 template<typename T> static const T *getAsSugar(const Type *Cur) { in getAsSugar() argument
309 if (const T *Sugar = dyn_cast<T>(Cur)) in getAsSugar()
311 switch (Cur->getTypeClass()) { in getAsSugar()
315 const Class##Type *Ty = cast<Class##Type>(Cur); \ in getAsSugar()
317 Cur = Ty->desugar().getTypePtr(); \ in getAsSugar()
341 const Type *Cur = this; in getUnqualifiedDesugaredType() local
344 switch (Cur->getTypeClass()) { in getUnqualifiedDesugaredType()
[all …]
/NextBSD/contrib/llvm/lib/Transforms/Utils/
HDLoopUtils.cpp91 Instruction *Cur = Worklist.back(); in AddReductionVar() local
97 if (Cur->use_empty()) in AddReductionVar()
100 bool IsAPhi = isa<PHINode>(Cur); in AddReductionVar()
103 if (Cur != Phi && IsAPhi && Cur->getParent() == Phi->getParent()) in AddReductionVar()
108 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
109 !isa<ICmpInst>(Cur) && !isa<FCmpInst>(Cur) && in AddReductionVar()
110 !VisitedInsts.count(dyn_cast<Instruction>(Cur->getOperand(0)))) in AddReductionVar()
114 ReduxDesc = isRecurrenceInstr(Cur, Kind, ReduxDesc, HasFunNoNaNAttr); in AddReductionVar()
120 hasMultipleUsesOf(Cur, VisitedInsts)) in AddReductionVar()
124 if (IsAPhi && Cur != Phi && !areAllUsesIn(Cur, VisitedInsts)) in AddReductionVar()
[all …]
HDLowerSwitch.cpp121 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks in runOnFunction() local
123 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) { in runOnFunction()
/NextBSD/contrib/llvm/lib/Support/
HDcircular_raw_ostream.cpp27 std::min(unsigned(Size), unsigned(BufferSize - (Cur - BufferArray))); in write_impl()
28 memcpy(Cur, Ptr, Bytes); in write_impl()
30 Cur += Bytes; in write_impl()
31 if (Cur == BufferArray + BufferSize) { in write_impl()
33 Cur = BufferArray; in write_impl()
/NextBSD/contrib/llvm/lib/CodeGen/
HDScheduleDAG.cpp238 SUnit *Cur = WorkList.back(); in ComputeDepth() local
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), in ComputeDepth()
243 E = Cur->Preds.end(); I != E; ++I) { in ComputeDepth()
256 if (MaxPredDepth != Cur->Depth) { in ComputeDepth()
257 Cur->setDepthDirty(); in ComputeDepth()
258 Cur->Depth = MaxPredDepth; in ComputeDepth()
260 Cur->isDepthCurrent = true; in ComputeDepth()
271 SUnit *Cur = WorkList.back(); in ComputeHeight() local
275 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), in ComputeHeight()
276 E = Cur->Succs.end(); I != E; ++I) { in ComputeHeight()
[all …]
HDRegAllocPBQP.cpp306 IntervalInfo Cur = Inactive.top(); in apply() local
311 (getEndPoint(*RetireItr) <= getStartPoint(Cur))) { in apply()
323 Cur = Inactive.top(); in apply()
328 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
350 Active.insert(Cur); in apply()
/NextBSD/contrib/llvm/lib/Analysis/
HDAliasSetTracker.cpp222 iterator Cur = I++; in findAliasSetForPointer() local
223 if (Cur->Forward || !Cur->aliasesPointer(Ptr, Size, AAInfo, AA)) continue; in findAliasSetForPointer()
226 FoundSet = Cur; // Remember it. in findAliasSetForPointer()
228 FoundSet->mergeSetIn(*Cur, *this); // Merge in contents. in findAliasSetForPointer()
256 iterator Cur = I++; in findAliasSetForUnknownInst() local
257 if (Cur->Forward || !Cur->aliasesUnknownInst(Inst, AA)) in findAliasSetForUnknownInst()
260 FoundSet = Cur; // Remember it. in findAliasSetForUnknownInst()
261 else if (!Cur->Forward) // Otherwise, we must merge the sets. in findAliasSetForUnknownInst()
262 FoundSet->mergeSetIn(*Cur, *this); // Merge in contents. in findAliasSetForUnknownInst()
517 iterator Cur = I++; in deleteValue() local
[all …]
HDTypeBasedAliasAnalysis.cpp237 uint64_t Cur = Node->getNumOperands() == 2 in getParent() local
241 Offset -= Cur; in getParent()
252 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(Idx + 1)) in getParent() local
254 if (Cur > Offset) { in getParent()
264 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(TheIdx + 1)) in getParent() local
266 Offset -= Cur; in getParent()
/NextBSD/contrib/llvm/utils/TableGen/
HDCodeGenInstruction.cpp383 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { in FlattenAsmStringVariants() argument
389 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart) in FlattenAsmStringVariants()
390 if (Cur[VariantsStart] == '{' && in FlattenAsmStringVariants()
391 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' && in FlattenAsmStringVariants()
392 Cur[VariantsStart-1] != '\\'))) in FlattenAsmStringVariants()
396 Res += Cur.slice(0, VariantsStart); in FlattenAsmStringVariants()
397 if (VariantsStart == Cur.size()) in FlattenAsmStringVariants()
405 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) { in FlattenAsmStringVariants()
406 if (Cur[VariantsEnd] == '}' && Cur[VariantsEnd-1] != '\\') { in FlattenAsmStringVariants()
409 } else if (Cur[VariantsEnd] == '{') in FlattenAsmStringVariants()
[all …]
HDDAGISelMatcher.cpp42 Matcher *Cur = this; in unlinkNode() local
43 for (; Cur && Cur->getNext() != Other; Cur = Cur->getNext()) in unlinkNode()
46 if (!Cur) return nullptr; in unlinkNode()
47 Cur->takeNext(); in unlinkNode()
48 Cur->setNext(Other->takeNext()); in unlinkNode()
HDRegisterInfoEmitter.cpp580 for (uint16_t Cur : List) { in diffEncode() local
581 V.push_back(Cur - Val); in diffEncode()
582 Val = Cur; in diffEncode()
593 uint16_t Cur = (*I)->EnumValue; in diffEncode() local
594 V.push_back(Cur - Val); in diffEncode()
595 Val = Cur; in diffEncode()
/NextBSD/contrib/llvm/lib/ProfileData/
HDInstrProfReader.cpp357 const unsigned char *Cur = Start; in readHeader() local
358 if ((const unsigned char *)DataBuffer->getBufferEnd() - Cur < 24) in readHeader()
364 uint64_t Magic = endian::readNext<uint64_t, little, unaligned>(Cur); in readHeader()
369 FormatVersion = endian::readNext<uint64_t, little, unaligned>(Cur); in readHeader()
374 MaxFunctionCount = endian::readNext<uint64_t, little, unaligned>(Cur); in readHeader()
378 endian::readNext<uint64_t, little, unaligned>(Cur)); in readHeader()
381 uint64_t HashOffset = endian::readNext<uint64_t, little, unaligned>(Cur); in readHeader()
385 Start + HashOffset, Cur, Start, in readHeader()
/NextBSD/contrib/llvm/lib/CodeGen/AsmPrinter/
HDDIEHash.cpp88 const DIE *Cur = &Parent; in addParentContext() local
89 while (Cur->getParent()) { in addParentContext()
90 Parents.push_back(Cur); in addParentContext()
91 Cur = Cur->getParent(); in addParentContext()
93 assert(Cur->getTag() == dwarf::DW_TAG_compile_unit || in addParentContext()
94 Cur->getTag() == dwarf::DW_TAG_type_unit); in addParentContext()
HDDwarfDebug.cpp1652 for (const SymbolCU &Cur : List) { in emitDebugARanges() local
1654 Span.Start = Cur.Sym; in emitDebugARanges()
1656 if (Cur.CU) in emitDebugARanges()
1657 Spans[Cur.CU].push_back(Span); in emitDebugARanges()
1681 const SymbolCU &Cur = List[n]; in emitDebugARanges() local
1684 if (Cur.CU != Prev.CU) { in emitDebugARanges()
1687 Span.End = Cur.Sym; in emitDebugARanges()
1689 StartSym = Cur.Sym; in emitDebugARanges()
/NextBSD/contrib/llvm/tools/llvm-diff/
HDDifferenceEngine.cpp497 DiffEntry *Cur = Paths1.data(); in runBlockDiff() local
508 Cur[I].Cost = I * LeftCost; in runBlockDiff()
510 Cur[I].Path.push_back(DC_left); in runBlockDiff()
515 Next[0] = Cur[0]; in runBlockDiff()
522 Next[Index] = Cur[Index-1]; in runBlockDiff()
526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { in runBlockDiff()
531 Next[Index] = Cur[Index]; in runBlockDiff()
537 std::swap(Cur, Next); in runBlockDiff()
544 SmallVectorImpl<char> &Path = Cur[NL].Path; in runBlockDiff()
/NextBSD/contrib/llvm/tools/clang/lib/Sema/
HDIdentifierResolver.cpp51 IdDeclInfoPool *Cur = CurPool; in ~IdDeclInfoMap() local
52 while (IdDeclInfoPool *P = Cur) { in ~IdDeclInfoMap()
53 Cur = Cur->Next; in ~IdDeclInfoMap()
HDSemaAccess.cpp634 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) { in findFriendship()
638 if (Cur == NamingClass) in findFriendship()
641 if (CheckDependent && MightInstantiateTo(Cur, NamingClass)) in findFriendship()
645 for (const auto &I : Cur->bases()) { in findFriendship()
676 bool findFriendship(const CXXRecordDecl *Cur) { in findFriendship()
678 CurPath.push_back(Cur); in findFriendship()
679 return findFriendship(Cur, 0); in findFriendship()
HDSemaDecl.cpp4631 DeclContext *Cur = CurContext; in diagnoseQualifiedDeclaration() local
4632 while (isa<LinkageSpecDecl>(Cur) || isa<CapturedDecl>(Cur)) in diagnoseQualifiedDeclaration()
4633 Cur = Cur->getParent(); in diagnoseQualifiedDeclaration()
4644 if (Cur->Equals(DC)) { in diagnoseQualifiedDeclaration()
4645 if (Cur->isRecord()) { in diagnoseQualifiedDeclaration()
4658 if (!Cur->Encloses(DC)) { in diagnoseQualifiedDeclaration()
4659 if (Cur->isRecord()) in diagnoseQualifiedDeclaration()
4665 else if (isa<FunctionDecl>(Cur)) in diagnoseQualifiedDeclaration()
4668 else if (isa<BlockDecl>(Cur)) in diagnoseQualifiedDeclaration()
4673 << Name << cast<NamedDecl>(Cur) << cast<NamedDecl>(DC) << SS.getRange(); in diagnoseQualifiedDeclaration()
[all …]
/NextBSD/contrib/llvm/lib/Support/Windows/
HDProgram.inc147 /// CountPrecedingBackslashes - Returns the number of backslashes preceding Cur
150 const char *Cur) {
152 --Cur;
153 while (Cur >= Start && *Cur == '\\') {
155 --Cur;
161 /// preceding Cur in the Start string. Assumes Dst has enough space.
163 const char *Cur) {
164 unsigned PrecedingEscapes = CountPrecedingBackslashes(Start, Cur);
/NextBSD/contrib/llvm/lib/Option/
HDArgList.cpp308 StringRef Cur = getArgString(Index); in GetOrMakeJoinedArgString() local
309 if (Cur.size() == LHS.size() + RHS.size() && in GetOrMakeJoinedArgString()
310 Cur.startswith(LHS) && Cur.endswith(RHS)) in GetOrMakeJoinedArgString()
311 return Cur.data(); in GetOrMakeJoinedArgString()
/NextBSD/contrib/llvm/lib/MC/
HDMCAssembler.cpp100 MCFragment *Cur = LastValidFragment[Sec]; in ensureValid() local
101 if (!Cur) in ensureValid()
102 Cur = Sec->begin(); in ensureValid()
104 Cur = Cur->getNextNode(); in ensureValid()
108 assert(Cur && "Layout bookkeeping error"); in ensureValid()
109 const_cast<MCAsmLayout*>(this)->layoutFragment(Cur); in ensureValid()
110 Cur = Cur->getNextNode(); in ensureValid()
/NextBSD/contrib/llvm/lib/Target/Sparc/
HDSparcAsmPrinter.cpp100 const MCSymbolRefExpr *Cur = MCSymbolRefExpr::create(CurLabel, in createPCXRelExprOp() local
103 const MCBinaryExpr *Sub = MCBinaryExpr::createSub(Cur, Start, OutContext); in createPCXRelExprOp()

12