/external/llvm/include/llvm/Support/ |
H A D | circular_raw_ostream.h | 58 /// Cur - Pointer to the current output point in BufferArray. 60 char *Cur; member in class:llvm::circular_raw_ostream 77 TheStream->write(Cur, BufferArray + BufferSize - Cur); 79 TheStream->write(BufferArray, Cur - BufferArray); 80 Cur = BufferArray; 120 Cur = BufferArray; 130 Cur = BufferArray;
|
H A D | Registry.h | 71 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) 72 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...] |
/external/lzma/CPP/7zip/Common/ |
H A D | CWrappers.h | 47 const Byte *Cur;
member in struct:CByteInBufWrap 62 Lim = Cur = Buf;
67 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
71 if (Cur != Lim)
72 return *Cur++;
80 Byte *Cur;
member in struct:CByteOutBufWrap 94 Cur = Buf;
99 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
103 *Cur++ = b;
104 if (Cur [all...] |
/external/clang/lib/AST/ |
H A D | TypeLoc.cpp | 129 TypeLoc Cur = *this; local 130 TypeLoc LeftMost = Cur; 132 switch (Cur.getTypeLocClass()) { 134 LeftMost = Cur; 137 if (Cur.castAs<FunctionProtoTypeLoc>().getTypePtr() 139 LeftMost = Cur; 150 Cur = Cur.getNextTypeLoc(); 153 if (!Cur.getLocalSourceRange().getBegin().isInvalid()) 154 LeftMost = Cur; 166 TypeLoc Cur = *this; local [all...] |
H A D | Type.cpp | 248 QualType Cur = T; local 250 const Type *CurTy = Qs.strip(Cur); 258 Cur = Ty->desugar(); \ 315 template<typename T> static const T *getAsSugar(const Type *Cur) { argument 317 if (const T *Sugar = dyn_cast<T>(Cur)) 319 switch (Cur->getTypeClass()) { 323 const Class##Type *Ty = cast<Class##Type>(Cur); \ 325 Cur = Ty->desugar().getTypePtr(); \ 345 const Type *Cur = this; local 348 switch (Cur [all...] |
/external/llvm/lib/IR/ |
H A D | DebugLoc.cpp | 221 MDNode *Cur = get(); local 225 assert(Ctx->ScopeRecordIdx[Cur] == Idx && "Mapping out of date!"); 226 Ctx->ScopeRecordIdx.erase(Cur);
|
H A D | Metadata.cpp | 56 MDNodeOperand *Cur = this; local 58 while (Cur->getValPtrInt() != 1) 59 --Cur; 61 assert(Cur->getValPtrInt() == 1 && 63 return reinterpret_cast<MDNode*>(Cur) - 1;
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMJITInfo.cpp | 144 uint8_t *Cur = Buffer; local 145 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)Ptr);
|
/external/clang/lib/Sema/ |
H A D | IdentifierResolver.cpp | 51 IdDeclInfoPool *Cur = CurPool; local 52 while (IdDeclInfoPool *P = Cur) { 53 Cur = Cur->Next;
|
H A D | SemaAccess.cpp | 641 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) { 645 if (Cur == NamingClass) 648 if (CheckDependent && MightInstantiateTo(Cur, NamingClass)) 653 I = Cur->bases_begin(), E = Cur->bases_end(); I != E; ++I) { 656 // base will not have any access in classes derived from Cur. 685 bool findFriendship(const CXXRecordDecl *Cur) { argument 687 CurPath.push_back(Cur); 688 return findFriendship(Cur, 0);
|
H A D | SemaChecking.cpp | 5591 /// is asymmetric: \p Cur should be the more recent sequence, and \p Old 5593 bool isUnsequenced(Seq Cur, Seq Old) { argument 5594 unsigned C = representative(Cur.Index);
|
H A D | SemaDecl.cpp | 4000 DeclContext *Cur = CurContext; local 4001 while (isa<LinkageSpecDecl>(Cur)) 4002 Cur = Cur->getParent(); 4019 if (Cur->Equals(DC)) { 4029 if (!Cur->Encloses(DC)) { 4030 if (Cur->isRecord()) 4036 else if (isa<FunctionDecl>(Cur)) 4041 << Name << cast<NamedDecl>(Cur) << cast<NamedDecl>(DC) << SS.getRange(); 4046 if (Cur [all...] |
H A D | SemaExpr.cpp | 247 void Sema::MaybeSuggestAddingStaticToDecl(const FunctionDecl *Cur) { argument 248 const FunctionDecl *First = Cur->getFirstDeclaration(); 254 << Cur << FixItHint::CreateInsertion(DeclBegin, "static ");
|
/external/llvm/lib/Analysis/ |
H A D | TypeBasedAliasAnalysis.cpp | 183 uint64_t Cur = cast<ConstantInt>(Node->getOperand(Idx + 1))-> local 185 if (Cur > Offset) { 195 uint64_t Cur = cast<ConstantInt>(Node->getOperand(TheIdx + 1))-> local 197 Offset -= Cur;
|
/external/llvm/lib/Option/ |
H A D | ArgList.cpp | 301 StringRef Cur = getArgString(Index); local 302 if (Cur.size() == LHS.size() + RHS.size() && 303 Cur.startswith(LHS) && Cur.endswith(RHS)) 304 return Cur.data();
|
/external/llvm/lib/Target/X86/ |
H A D | X86JITInfo.cpp | 448 uint8_t *Cur = Buffer; local 449 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(intptr_t)ptr); 450 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(((intptr_t)ptr) >> 32)); 454 uint8_t *Cur = Buffer; 455 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)ptr);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 86 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks local 88 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) {
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 499 DiffEntry *Cur = Paths1.data(); local 510 Cur[I].Cost = I * LeftCost; 512 Cur[I].Path.push_back(DC_left); 517 Next[0] = Cur[0]; 524 Next[Index] = Cur[Index-1]; 528 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { 533 Next[Index] = Cur[Index]; 539 std::swap(Cur, Next); 546 SmallVectorImpl<char> &Path = Cur[NL].Path;
|
/external/llvm/utils/TableGen/ |
H A D | CodeGenInstruction.cpp | 362 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { argument 368 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart) 369 if (Cur[VariantsStart] == '{' && 370 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' && 371 Cur[VariantsStart-1] != '\\'))) 375 Res += Cur.slice(0, VariantsStart); 376 if (VariantsStart == Cur.size()) 384 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) { 385 if (Cur[VariantsEnd] == '}' && Cur[VariantsEn [all...] |
H A D | RegisterInfoEmitter.cpp | 577 uint16_t Cur = List[i]; local 578 V.push_back(Cur - Val); 579 Val = Cur; 590 uint16_t Cur = (*I)->EnumValue; local 591 V.push_back(Cur - Val); 592 Val = Cur;
|
/external/llvm/lib/MC/ |
H A D | MCAssembler.cpp | 99 MCFragment *Cur = LastValidFragment[&SD]; local 100 if (!Cur) 101 Cur = &*SD.begin(); 103 Cur = Cur->getNextNode(); 107 assert(Cur && "Layout bookkeeping error"); 108 const_cast<MCAsmLayout*>(this)->layoutFragment(Cur); 109 Cur = Cur->getNextNode();
|