| /external/llvm/include/llvm/Support/ |
| D | Registry.h | 72 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) in Announce() local
73 Cur->registered(E); in Announce()
106 const node *Cur; variable
109 explicit iterator(const node *N) : Cur(N) {} in iterator()
111 bool operator==(const iterator &That) const { return Cur == That.Cur; }
112 bool operator!=(const iterator &That) const { return Cur != That.Cur; }
113 iterator &operator++() { Cur = Cur->Next; return *this; }
114 const entry &operator*() const { return Cur->Val; }
115 const entry *operator->() const { return &Cur->Val; }
|
| D | circular_raw_ostream.h | 59 char *Cur; variable
76 TheStream->write(Cur, BufferArray + BufferSize - Cur); in flushBuffer()
78 TheStream->write(BufferArray, Cur - BufferArray); in flushBuffer()
79 Cur = BufferArray; in flushBuffer()
115 Cur = BufferArray; in raw_ostream()
|
| /external/lzma/CPP/7zip/Common/ |
| D | CWrappers.h | 52 const Byte *Cur; member
67 Lim = Cur = Buf; in Init()
72 UInt64 GetProcessed() const { return Processed + (Cur - Buf); } in GetProcessed()
76 if (Cur != Lim) in ReadByte()
77 return *Cur++; in ReadByte()
85 Byte *Cur; member
99 Cur = Buf; in Init()
104 UInt64 GetProcessed() const { return Processed + (Cur - Buf); } in GetProcessed()
108 *Cur++ = b; in WriteByte()
109 if (Cur == Lim) in WriteByte()
|
| D | CWrappers.cpp | 149 Lim = Cur = Buf = (Byte *)::MidAlloc((size_t)size); in Alloc()
160 Processed += (Cur - Buf); in ReadByteFromNewBlock()
162 Cur = Buf; in ReadByteFromNewBlock()
165 return *Cur++; in ReadByteFromNewBlock()
174 if (p->Cur != p->Lim) in Wrap_ReadByte()
175 return *p->Cur++; in Wrap_ReadByte()
208 size_t size = (Cur - Buf); in Flush()
212 Cur = Buf; in Flush()
220 Byte *dest = p->Cur; in Wrap_WriteByte()
222 p->Cur = ++dest; in Wrap_WriteByte()
|
| /external/clang/lib/AST/ |
| D | TypeLoc.cpp | 171 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().isValid()) in getBeginLoc()
196 LeftMost = Cur; in getBeginLoc()
197 Cur = Cur.getNextTypeLoc(); in getBeginLoc()
[all …]
|
| D | Type.cpp | 241 QualType Cur = T; in getSplitDesugaredType() local
243 const Type *CurTy = Qs.strip(Cur); in getSplitDesugaredType()
251 Cur = Ty->desugar(); \ in getSplitDesugaredType()
308 template<typename T> static const T *getAsSugar(const Type *Cur) { in getAsSugar() argument
310 if (const T *Sugar = dyn_cast<T>(Cur)) in getAsSugar()
312 switch (Cur->getTypeClass()) { in getAsSugar()
316 const Class##Type *Ty = cast<Class##Type>(Cur); \ in getAsSugar()
318 Cur = Ty->desugar().getTypePtr(); \ in getAsSugar()
342 const Type *Cur = this; in getUnqualifiedDesugaredType() local
345 switch (Cur->getTypeClass()) { in getUnqualifiedDesugaredType()
[all …]
|
| /external/llvm/lib/Support/ |
| D | circular_raw_ostream.cpp | 27 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()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LoopUtils.cpp | 231 Instruction *Cur = Worklist.back(); in AddReductionVar() local
237 if (Cur->use_empty()) in AddReductionVar()
240 bool IsAPhi = isa<PHINode>(Cur); in AddReductionVar()
243 if (Cur != Phi && IsAPhi && Cur->getParent() == Phi->getParent()) in AddReductionVar()
248 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
249 !isa<ICmpInst>(Cur) && !isa<FCmpInst>(Cur) && in AddReductionVar()
250 !VisitedInsts.count(dyn_cast<Instruction>(Cur->getOperand(0)))) in AddReductionVar()
256 if (Cur != Start) { in AddReductionVar()
257 ReduxDesc = isRecurrenceInstr(Cur, Kind, ReduxDesc, HasFunNoNaNAttr); in AddReductionVar()
264 hasMultipleUsesOf(Cur, VisitedInsts)) in AddReductionVar()
[all …]
|
| D | LowerSwitch.cpp | 121 BasicBlock *Cur = &*I++; // Advance over block so we don't traverse new blocks in runOnFunction() local
125 if (DeleteList.count(Cur)) in runOnFunction()
128 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) { in runOnFunction()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 238 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 …]
|
| D | RegAllocPBQP.cpp | 307 IntervalInfo Cur = Inactive.top(); in apply() local
312 (getEndPoint(*RetireItr) <= getStartPoint(Cur))) { in apply()
324 Cur = Inactive.top(); in apply()
329 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
351 Active.insert(Cur); in apply()
|
| /external/llvm/lib/Analysis/ |
| D | AliasSetTracker.cpp | 220 iterator Cur = I++; in findAliasSetForPointer() local
221 if (Cur->Forward || !Cur->aliasesPointer(Ptr, Size, AAInfo, AA)) continue; in findAliasSetForPointer()
224 FoundSet = &*Cur; // Remember it. in findAliasSetForPointer()
226 FoundSet->mergeSetIn(*Cur, *this); // Merge in contents. in findAliasSetForPointer()
254 iterator Cur = I++; in findAliasSetForUnknownInst() local
255 if (Cur->Forward || !Cur->aliasesUnknownInst(Inst, AA)) in findAliasSetForUnknownInst()
258 FoundSet = &*Cur; // Remember it. in findAliasSetForUnknownInst()
259 else if (!Cur->Forward) // Otherwise, we must merge the sets. in findAliasSetForUnknownInst()
260 FoundSet->mergeSetIn(*Cur, *this); // Merge in contents. in findAliasSetForUnknownInst()
516 iterator Cur = I++; in deleteValue() local
[all …]
|
| D | TypeBasedAliasAnalysis.cpp | 235 uint64_t Cur = Node->getNumOperands() == 2 in getParent() local
239 Offset -= Cur; in getParent()
250 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(Idx + 1)) in getParent() local
252 if (Cur > Offset) { in getParent()
262 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(TheIdx + 1)) in getParent() local
264 Offset -= Cur; in getParent()
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenInstruction.cpp | 383 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 …]
|
| D | DAGISelMatcher.cpp | 42 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()
|
| D | RegisterInfoEmitter.cpp | 580 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()
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DIEHash.cpp | 88 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()
|
| D | DwarfDebug.cpp | 1673 for (const SymbolCU &Cur : List) { in emitDebugARanges() local
1675 Span.Start = Cur.Sym; in emitDebugARanges()
1677 if (Cur.CU) in emitDebugARanges()
1678 Spans[Cur.CU].push_back(Span); in emitDebugARanges()
1702 const SymbolCU &Cur = List[n]; in emitDebugARanges() local
1705 if (Cur.CU != Prev.CU) { in emitDebugARanges()
1708 Span.End = Cur.Sym; in emitDebugARanges()
1710 StartSym = Cur.Sym; in emitDebugARanges()
|
| /external/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 497 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()
|
| /external/llvm/lib/Fuzzer/ |
| D | FuzzerTraceState.cpp | 298 for (const uint8_t *Cur = Beg; Cur < End; Cur++) { in TryToAddDesiredData() local
299 Cur = (uint8_t *)memmem(Cur, End - Cur, &PresentData, DataSize); in TryToAddDesiredData()
300 if (!Cur) in TryToAddDesiredData()
302 size_t Pos = Cur - Beg; in TryToAddDesiredData()
|
| /external/clang/lib/Sema/ |
| D | IdentifierResolver.cpp | 51 IdDeclInfoPool *Cur = CurPool; in ~IdDeclInfoMap() local
52 while (IdDeclInfoPool *P = Cur) { in ~IdDeclInfoMap()
53 Cur = Cur->Next; in ~IdDeclInfoMap()
|
| D | SemaAccess.cpp | 639 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) { in findFriendship()
643 if (Cur == NamingClass) in findFriendship()
646 if (CheckDependent && MightInstantiateTo(Cur, NamingClass)) in findFriendship()
650 for (const auto &I : Cur->bases()) { in findFriendship()
681 bool findFriendship(const CXXRecordDecl *Cur) { in findFriendship()
683 CurPath.push_back(Cur); in findFriendship()
684 return findFriendship(Cur, 0); in findFriendship()
|
| /external/llvm/lib/Support/Windows/ |
| D | Program.inc | 154 /// 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);
|
| /external/llvm/lib/Option/ |
| D | ArgList.cpp | 324 StringRef Cur = getArgString(Index); in GetOrMakeJoinedArgString() local
325 if (Cur.size() == LHS.size() + RHS.size() && in GetOrMakeJoinedArgString()
326 Cur.startswith(LHS) && Cur.endswith(RHS)) in GetOrMakeJoinedArgString()
327 return Cur.data(); in GetOrMakeJoinedArgString()
|
| /external/llvm/lib/ProfileData/ |
| D | InstrProfReader.cpp | 559 const unsigned char *Cur = Start; in readHeader() local
560 if ((const unsigned char *)DataBuffer->getBufferEnd() - Cur < 24) in readHeader()
565 auto *Header = reinterpret_cast<const IndexedInstrProf::Header *>(Cur); in readHeader()
566 Cur += sizeof(IndexedInstrProf::Header); in readHeader()
593 Start + HashOffset, Cur, Start, HashType, FormatVersion); in readHeader()
|