| /external/llvm/include/llvm/Support/ |
| D | Registry.h | 71 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) in Announce() local
72 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 | 60 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()
120 Cur = BufferArray; in raw_ostream()
130 Cur = BufferArray; in circular_raw_ostream()
|
| /external/lzma/CPP/7zip/Common/ |
| D | CWrappers.h | 47 const Byte *Cur; member
62 Lim = Cur = Buf; in Init()
67 UInt64 GetProcessed() const { return Processed + (Cur - Buf); } in GetProcessed()
71 if (Cur != Lim) in ReadByte()
72 return *Cur++; in ReadByte()
80 Byte *Cur; member
94 Cur = Buf; in Init()
99 UInt64 GetProcessed() const { return Processed + (Cur - Buf); } in GetProcessed()
103 *Cur++ = b; in WriteByte()
104 if (Cur == Lim) in WriteByte()
|
| D | CWrappers.cpp | 145 Lim = Cur = Buf = (Byte *)::MidAlloc((size_t)size); in Alloc()
156 Processed += (Cur - Buf); in ReadByteFromNewBlock()
158 Cur = Buf; in ReadByteFromNewBlock()
161 return *Cur++; in ReadByteFromNewBlock()
170 if (p->Cur != p->Lim) in Wrap_ReadByte()
171 return *p->Cur++; in Wrap_ReadByte()
204 size_t size = (Cur - Buf); in Flush()
208 Cur = Buf; in Flush()
216 Byte *dest = p->Cur; in Wrap_WriteByte()
218 p->Cur = ++dest; in Wrap_WriteByte()
|
| /external/clang/lib/AST/ |
| D | TypeLoc.cpp | 129 TypeLoc Cur = *this; in getBeginLoc() local
130 TypeLoc LeftMost = Cur; in getBeginLoc()
132 switch (Cur.getTypeLocClass()) { in getBeginLoc()
134 LeftMost = Cur; in getBeginLoc()
137 if (Cur.castAs<FunctionProtoTypeLoc>().getTypePtr() in getBeginLoc()
139 LeftMost = Cur; in getBeginLoc()
150 Cur = Cur.getNextTypeLoc(); in getBeginLoc()
153 if (!Cur.getLocalSourceRange().getBegin().isInvalid()) in getBeginLoc()
154 LeftMost = Cur; in getBeginLoc()
155 Cur = Cur.getNextTypeLoc(); in getBeginLoc()
[all …]
|
| D | Type.cpp | 248 QualType Cur = T; in getSplitDesugaredType() local
250 const Type *CurTy = Qs.strip(Cur); in getSplitDesugaredType()
258 Cur = Ty->desugar(); \ in getSplitDesugaredType()
315 template<typename T> static const T *getAsSugar(const Type *Cur) { in getAsSugar() argument
317 if (const T *Sugar = dyn_cast<T>(Cur)) in getAsSugar()
319 switch (Cur->getTypeClass()) { in getAsSugar()
323 const Class##Type *Ty = cast<Class##Type>(Cur); \ in getAsSugar()
325 Cur = Ty->desugar().getTypePtr(); \ in getAsSugar()
345 const Type *Cur = this; in getUnqualifiedDesugaredType() local
348 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/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 …]
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenInstruction.cpp | 362 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { in FlattenAsmStringVariants() argument
368 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart) in FlattenAsmStringVariants()
369 if (Cur[VariantsStart] == '{' && in FlattenAsmStringVariants()
370 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' && in FlattenAsmStringVariants()
371 Cur[VariantsStart-1] != '\\'))) in FlattenAsmStringVariants()
375 Res += Cur.slice(0, VariantsStart); in FlattenAsmStringVariants()
376 if (VariantsStart == Cur.size()) in FlattenAsmStringVariants()
384 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) { in FlattenAsmStringVariants()
385 if (Cur[VariantsEnd] == '}' && Cur[VariantsEnd-1] != '\\') { in FlattenAsmStringVariants()
388 } 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 == 0) return 0; in unlinkNode()
47 Cur->takeNext(); in unlinkNode()
48 Cur->setNext(Other->takeNext()); in unlinkNode()
|
| D | RegisterInfoEmitter.cpp | 577 uint16_t Cur = List[i]; in diffEncode() local
578 V.push_back(Cur - Val); in diffEncode()
579 Val = Cur; in diffEncode()
590 uint16_t Cur = (*I)->EnumValue; in diffEncode() local
591 V.push_back(Cur - Val); in diffEncode()
592 Val = Cur; in diffEncode()
|
| /external/llvm/lib/Target/X86/ |
| D | X86JITInfo.cpp | 448 uint8_t *Cur = Buffer; in emitGlobalValueIndirectSym() local
449 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(intptr_t)ptr); in emitGlobalValueIndirectSym()
450 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(((intptr_t)ptr) >> 32)); in emitGlobalValueIndirectSym()
454 uint8_t *Cur = Buffer; in emitGlobalValueIndirectSym()
455 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)ptr); in emitGlobalValueIndirectSym()
|
| /external/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 499 DiffEntry *Cur = Paths1.data(); in runBlockDiff() local
510 Cur[I].Cost = I * LeftCost; in runBlockDiff()
512 Cur[I].Path.push_back(DC_left); in runBlockDiff()
517 Next[0] = Cur[0]; in runBlockDiff()
524 Next[Index] = Cur[Index-1]; in runBlockDiff()
528 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { in runBlockDiff()
533 Next[Index] = Cur[Index]; in runBlockDiff()
539 std::swap(Cur, Next); in runBlockDiff()
546 SmallVectorImpl<char> &Path = Cur[NL].Path; in runBlockDiff()
|
| /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 | 641 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) { in findFriendship()
645 if (Cur == NamingClass) in findFriendship()
648 if (CheckDependent && MightInstantiateTo(Cur, NamingClass)) in findFriendship()
653 I = Cur->bases_begin(), E = Cur->bases_end(); I != E; ++I) { in findFriendship()
685 bool findFriendship(const CXXRecordDecl *Cur) { in findFriendship()
687 CurPath.push_back(Cur); in findFriendship()
688 return findFriendship(Cur, 0); in findFriendship()
|
| D | SemaDecl.cpp | 4000 DeclContext *Cur = CurContext; in diagnoseQualifiedDeclaration() local
4001 while (isa<LinkageSpecDecl>(Cur)) in diagnoseQualifiedDeclaration()
4002 Cur = Cur->getParent(); in diagnoseQualifiedDeclaration()
4019 if (Cur->Equals(DC)) { in diagnoseQualifiedDeclaration()
4029 if (!Cur->Encloses(DC)) { in diagnoseQualifiedDeclaration()
4030 if (Cur->isRecord()) in diagnoseQualifiedDeclaration()
4036 else if (isa<FunctionDecl>(Cur)) in diagnoseQualifiedDeclaration()
4041 << Name << cast<NamedDecl>(Cur) << cast<NamedDecl>(DC) << SS.getRange(); in diagnoseQualifiedDeclaration()
4046 if (Cur->isRecord()) { in diagnoseQualifiedDeclaration()
4058 Context.getTypeDeclType(cast<CXXRecordDecl>(Cur)))) in diagnoseQualifiedDeclaration()
|
| /external/llvm/lib/Support/Windows/ |
| D | Program.inc | 117 /// CountPrecedingBackslashes - Returns the number of backslashes preceding Cur
120 const char *Cur) {
122 --Cur;
123 while (Cur >= Start && *Cur == '\\') {
125 --Cur;
131 /// preceding Cur in the Start string. Assumes Dst has enough space.
133 const char *Cur) {
134 unsigned PrecedingEscapes = CountPrecedingBackslashes(Start, Cur);
|
| /external/llvm/lib/Analysis/ |
| D | TypeBasedAliasAnalysis.cpp | 183 uint64_t Cur = cast<ConstantInt>(Node->getOperand(Idx + 1))-> in getParent() local
185 if (Cur > Offset) { in getParent()
195 uint64_t Cur = cast<ConstantInt>(Node->getOperand(TheIdx + 1))-> in getParent() local
197 Offset -= Cur; in getParent()
|
| /external/llvm/lib/Option/ |
| D | ArgList.cpp | 301 StringRef Cur = getArgString(Index); in GetOrMakeJoinedArgString() local
302 if (Cur.size() == LHS.size() + RHS.size() && in GetOrMakeJoinedArgString()
303 Cur.startswith(LHS) && Cur.endswith(RHS)) in GetOrMakeJoinedArgString()
304 return Cur.data(); in GetOrMakeJoinedArgString()
|
| /external/llvm/lib/IR/ |
| D | DebugLoc.cpp | 221 MDNode *Cur = get(); in deleted() local
225 assert(Ctx->ScopeRecordIdx[Cur] == Idx && "Mapping out of date!"); in deleted()
226 Ctx->ScopeRecordIdx.erase(Cur); in deleted()
|
| D | Metadata.cpp | 56 MDNodeOperand *Cur = this; in getParent() local
58 while (Cur->getValPtrInt() != 1) in getParent()
59 --Cur; in getParent()
61 assert(Cur->getValPtrInt() == 1 && in getParent()
63 return reinterpret_cast<MDNode*>(Cur) - 1; in getParent()
|
| /external/llvm/lib/MC/ |
| D | MCAssembler.cpp | 99 MCFragment *Cur = LastValidFragment[&SD]; in ensureValid() local
100 if (!Cur) in ensureValid()
101 Cur = &*SD.begin(); in ensureValid()
103 Cur = Cur->getNextNode(); in ensureValid()
107 assert(Cur && "Layout bookkeeping error"); in ensureValid()
108 const_cast<MCAsmLayout*>(this)->layoutFragment(Cur); in ensureValid()
109 Cur = Cur->getNextNode(); in ensureValid()
|
| /external/llvm/lib/Target/ARM/ |
| D | ARMJITInfo.cpp | 144 uint8_t *Cur = Buffer; in emitGlobalValueIndirectSym() local
145 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)Ptr); in emitGlobalValueIndirectSym()
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 3777 Instruction *Cur = Worklist.back(); in AddReductionVar() local
3783 if (Cur->use_empty()) in AddReductionVar()
3786 bool IsAPhi = isa<PHINode>(Cur); in AddReductionVar()
3789 if (Cur != Phi && IsAPhi && Cur->getParent() == Phi->getParent()) in AddReductionVar()
3794 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
3795 !isa<ICmpInst>(Cur) && !isa<FCmpInst>(Cur) && in AddReductionVar()
3796 !VisitedInsts.count(dyn_cast<Instruction>(Cur->getOperand(0)))) in AddReductionVar()
3800 ReduxDesc = isReductionInstr(Cur, Kind, ReduxDesc); in AddReductionVar()
3806 hasMultipleUsesOf(Cur, VisitedInsts)) in AddReductionVar()
3810 if(IsAPhi && Cur != Phi && !areAllUsesIn(Cur, VisitedInsts)) in AddReductionVar()
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LowerSwitch.cpp | 86 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks in runOnFunction() local
88 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) { in runOnFunction()
|