Searched refs:Cur (Results 1 - 25 of 27) sorted by relevance

12

/freebsd-11.0-release/contrib/llvm/lib/Support/
H A Dcircular_raw_ostream.cpp27 std::min(unsigned(Size), unsigned(BufferSize - (Cur - BufferArray)));
28 memcpy(Cur, Ptr, Bytes);
30 Cur += Bytes;
31 if (Cur == BufferArray + BufferSize) {
33 Cur = BufferArray;
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/
H A Dcircular_raw_ostream.h57 /// Cur - Pointer to the current output point in BufferArray.
59 char *Cur; member in class:llvm::circular_raw_ostream
76 TheStream->write(Cur, BufferArray + BufferSize - Cur);
78 TheStream->write(BufferArray, Cur - BufferArray);
79 Cur = BufferArray;
115 Cur = BufferArray;
H A DRegistry.h72 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
73 Cur->registered(E);
106 const node *Cur; member in class:llvm::Registry::iterator
109 explicit iterator(const node *N) : Cur(N) {}
111 bool operator==(const iterator &That) const { return Cur == That.Cur; }
112 bool operator!=(const iterator &That) const { return Cur !
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/AST/
H A DTypeLoc.cpp171 TypeLoc Cur = *this; local
172 TypeLoc LeftMost = Cur;
174 switch (Cur.getTypeLocClass()) {
176 LeftMost = Cur;
179 if (Cur.castAs<FunctionProtoTypeLoc>().getTypePtr()
181 LeftMost = Cur;
192 Cur = Cur.getNextTypeLoc();
195 if (Cur.getLocalSourceRange().getBegin().isValid())
196 LeftMost = Cur;
208 TypeLoc Cur = *this; local
[all...]
H A DType.cpp241 QualType Cur = T; local
243 const Type *CurTy = Qs.strip(Cur);
251 Cur = Ty->desugar(); \
308 template<typename T> static const T *getAsSugar(const Type *Cur) { argument
310 if (const T *Sugar = dyn_cast<T>(Cur))
312 switch (Cur->getTypeClass()) {
316 const Class##Type *Ty = cast<Class##Type>(Cur); \
318 Cur = Ty->desugar().getTypePtr(); \
342 const Type *Cur = this; local
345 switch (Cur
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DLoopUtils.cpp231 Instruction *Cur = Worklist.back(); local
237 if (Cur->use_empty())
240 bool IsAPhi = isa<PHINode>(Cur);
243 if (Cur != Phi && IsAPhi && Cur->getParent() == Phi->getParent())
248 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) &&
249 !isa<ICmpInst>(Cur) && !isa<FCmpInst>(Cur) &&
250 !VisitedInsts.count(dyn_cast<Instruction>(Cur
[all...]
H A DLowerSwitch.cpp121 BasicBlock *Cur = &*I++; // Advance over block so we don't traverse new blocks local
125 if (DeleteList.count(Cur))
128 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) {
/freebsd-11.0-release/contrib/llvm/lib/Support/Windows/
H A DProgram.inc154 /// CountPrecedingBackslashes - Returns the number of backslashes preceding Cur
157 const char *Cur) {
159 --Cur;
160 while (Cur >= Start && *Cur == '\\') {
162 --Cur;
168 /// preceding Cur in the Start string. Assumes Dst has enough space.
170 const char *Cur) {
171 unsigned PrecedingEscapes = CountPrecedingBackslashes(Start, Cur);
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DAliasSetTracker.cpp220 iterator Cur = I++; local
221 if (Cur->Forward || !Cur->aliasesPointer(Ptr, Size, AAInfo, AA)) continue;
224 FoundSet = &*Cur; // Remember it.
226 FoundSet->mergeSetIn(*Cur, *this); // Merge in contents.
254 iterator Cur = I++; local
255 if (Cur->Forward || !Cur->aliasesUnknownInst(Inst, AA))
258 FoundSet = &*Cur; // Remember it.
259 else if (!Cur
516 iterator Cur = I++; local
[all...]
H A DTypeBasedAliasAnalysis.cpp235 uint64_t Cur = Node->getNumOperands() == 2 local
239 Offset -= Cur;
250 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(Idx + 1)) local
252 if (Cur > Offset) {
262 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(TheIdx + 1)) local
264 Offset -= Cur;
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp238 SUnit *Cur = WorkList.back();
242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(),
243 E = Cur->Preds.end(); I != E; ++I) {
256 if (MaxPredDepth != Cur->Depth) {
257 Cur->setDepthDirty();
258 Cur->Depth = MaxPredDepth;
260 Cur->isDepthCurrent = true;
271 SUnit *Cur = WorkList.back();
275 for (SUnit::const_succ_iterator I = Cur->Succs.begin(),
276 E = Cur
[all...]
H A DRegAllocPBQP.cpp307 IntervalInfo Cur = Inactive.top(); variable
309 // Retire any active intervals that end before Cur starts.
312 (getEndPoint(*RetireItr) <= getStartPoint(Cur))) {
323 // Cur segment, so re-grab the front of the inactive list.
324 Cur = Inactive.top();
327 // At this point we know that Cur overlaps all active intervals. Add the
329 PBQP::GraphBase::NodeId NId = getNodeId(Cur);
350 // Finally, add Cur to the Active set.
351 Active.insert(Cur);
/freebsd-11.0-release/contrib/llvm/utils/TableGen/
H A DDAGISelMatcher.cpp42 Matcher *Cur = this;
43 for (; Cur && Cur->getNext() != Other; Cur = Cur->getNext())
46 if (!Cur) return nullptr;
47 Cur->takeNext();
48 Cur->setNext(Other->takeNext());
H A DCodeGenInstruction.cpp384 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { argument
390 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart)
391 if (Cur[VariantsStart] == '{' &&
392 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' &&
393 Cur[VariantsStart-1] != '\\')))
397 Res += Cur.slice(0, VariantsStart);
398 if (VariantsStart == Cur.size())
406 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) {
407 if (Cur[VariantsEnd] == '}' && Cur[VariantsEn
[all...]
H A DRegisterInfoEmitter.cpp580 for (uint16_t Cur : List) {
581 V.push_back(Cur - Val);
582 Val = Cur;
593 uint16_t Cur = (*I)->EnumValue; local
594 V.push_back(Cur - Val);
595 Val = Cur;
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DDIEHash.cpp88 const DIE *Cur = &Parent; local
89 while (Cur->getParent()) {
90 Parents.push_back(Cur);
91 Cur = Cur->getParent();
93 assert(Cur->getTag() == dwarf::DW_TAG_compile_unit ||
94 Cur->getTag() == dwarf::DW_TAG_type_unit);
H A DDwarfDebug.cpp1734 for (const SymbolCU &Cur : List) {
1736 Span.Start = Cur.Sym;
1738 if (Cur.CU)
1739 Spans[Cur.CU].push_back(Span);
1763 const SymbolCU &Cur = List[n]; local
1766 if (Cur.CU != Prev.CU) {
1769 Span.End = Cur.Sym;
1771 StartSym = Cur.Sym;
/freebsd-11.0-release/contrib/llvm/tools/llvm-diff/
H A DDifferenceEngine.cpp497 DiffEntry *Cur = Paths1.data(); local
508 Cur[I].Cost = I * LeftCost;
510 Cur[I].Path.push_back(DC_left);
515 Next[0] = Cur[0];
522 Next[Index] = Cur[Index-1];
526 } else if (Next[Index-1].Cost <= Cur[Index].Cost) {
531 Next[Index] = Cur[Index];
537 std::swap(Cur, Next);
544 SmallVectorImpl<char> &Path = Cur[NL].Path;
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Sema/
H A DIdentifierResolver.cpp51 IdDeclInfoPool *Cur = CurPool; local
52 while (IdDeclInfoPool *P = Cur) {
53 Cur = Cur->Next;
H A DSemaAccess.cpp639 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) {
643 if (Cur == NamingClass)
646 if (CheckDependent && MightInstantiateTo(Cur, NamingClass))
650 for (const auto &I : Cur->bases()) {
652 // base will not have any access in classes derived from Cur.
681 bool findFriendship(const CXXRecordDecl *Cur) { argument
683 CurPath.push_back(Cur);
684 return findFriendship(Cur, 0);
/freebsd-11.0-release/contrib/llvm/lib/Option/
H A DArgList.cpp324 StringRef Cur = getArgString(Index); local
325 if (Cur.size() == LHS.size() + RHS.size() &&
326 Cur.startswith(LHS) && Cur.endswith(RHS))
327 return Cur.data();
/freebsd-11.0-release/contrib/llvm/lib/ProfileData/
H A DInstrProfReader.cpp559 const unsigned char *Cur = Start;
560 if ((const unsigned char *)DataBuffer->getBufferEnd() - Cur < 24)
565 auto *Header = reinterpret_cast<const IndexedInstrProf::Header *>(Cur);
566 Cur += sizeof(IndexedInstrProf::Header);
593 Start + HashOffset, Cur, Start, HashType, FormatVersion);
/freebsd-11.0-release/contrib/llvm/lib/MC/
H A DMCFragment.cpp65 if (MCFragment *Cur = LastValidFragment[Sec])
66 I = ++MCSection::iterator(Cur);
/freebsd-11.0-release/contrib/llvm/lib/Target/Sparc/
H A DSparcAsmPrinter.cpp100 const MCSymbolRefExpr *Cur = MCSymbolRefExpr::create(CurLabel, local
103 const MCBinaryExpr *Sub = MCBinaryExpr::createSub(Cur, Start, OutContext);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DSeparateConstOffsetFromGEP.cpp1157 Instruction *Cur = &*I++; local
1158 Changed |= reuniteExts(Cur);

Completed in 276 milliseconds

12