/external/clang/lib/AST/ |
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(); \ 349 const Type *Cur = this; local 352 switch (Cur [all...] |
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...] |
/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 | 634 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) { 638 if (Cur == NamingClass) 641 if (CheckDependent && MightInstantiateTo(Cur, NamingClass)) 645 for (const auto &I : Cur->bases()) { 647 // base will not have any access in classes derived from Cur. 676 bool findFriendship(const CXXRecordDecl *Cur) { argument 678 CurPath.push_back(Cur); 679 return findFriendship(Cur, 0);
|
H A D | SemaChecking.cpp | 6452 /// is asymmetric: \p Cur should be the more recent sequence, and \p Old 6454 bool isUnsequenced(Seq Cur, Seq Old) { argument 6455 unsigned C = representative(Cur.Index);
|
H A D | SemaDecl.cpp | 4286 DeclContext *Cur = CurContext; local 4287 while (isa<LinkageSpecDecl>(Cur) || isa<CapturedDecl>(Cur)) 4288 Cur = Cur->getParent(); 4299 if (Cur->Equals(DC)) { 4300 if (Cur->isRecord()) { 4313 if (!Cur->Encloses(DC)) { 4314 if (Cur->isRecord()) 4320 else if (isa<FunctionDecl>(Cur)) [all...] |
H A D | SemaExpr.cpp | 239 void Sema::MaybeSuggestAddingStaticToDecl(const FunctionDecl *Cur) { argument 240 const FunctionDecl *First = Cur->getFirstDecl(); 246 << Cur << FixItHint::CreateInsertion(DeclBegin, "static ");
|
/external/llvm/include/llvm/Support/ |
H A D | Registry.h | 74 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) 75 Cur->registered(E); 109 const node *Cur; member in class:llvm::Registry::iterator 112 explicit iterator(const node *N) : Cur(N) {} 114 bool operator==(const iterator &That) const { return Cur == That.Cur; } 115 bool operator!=(const iterator &That) const { return Cur ! [all...] |
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;
|
/external/llvm/lib/Analysis/ |
H A D | TypeBasedAliasAnalysis.cpp | 236 uint64_t Cur = Node->getNumOperands() == 2 ? 0 : local 238 Offset -= Cur; 249 uint64_t Cur = cast<ConstantInt>(Node->getOperand(Idx + 1))-> local 251 if (Cur > Offset) { 261 uint64_t Cur = cast<ConstantInt>(Node->getOperand(TheIdx + 1))-> local 263 Offset -= Cur;
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DIEHash.cpp | 95 const DIE *Cur = &Parent; local 96 while (Cur->getParent()) { 97 Parents.push_back(Cur); 98 Cur = Cur->getParent(); 100 assert(Cur->getTag() == dwarf::DW_TAG_compile_unit || 101 Cur->getTag() == dwarf::DW_TAG_type_unit);
|
H A D | DwarfDebug.cpp | 2131 for (const SymbolCU &Cur : List) { 2133 Span.Start = Cur.Sym; 2135 if (Cur.CU) 2136 Spans[Cur.CU].push_back(Span); 2143 const SymbolCU &Cur = List[n]; local 2146 if (Cur.CU != Prev.CU) { 2149 Span.End = Cur.Sym; 2151 StartSym = Cur.Sym;
|
/external/llvm/lib/IR/ |
H A D | DebugLoc.cpp | 264 MDNode *Cur = get(); local 268 assert(Ctx->ScopeRecordIdx[Cur] == Idx && "Mapping out of date!"); 269 Ctx->ScopeRecordIdx.erase(Cur);
|
H A D | Metadata.cpp | 57 MDNodeOperand *Cur = this; local 59 while (Cur->getValPtrInt() != 1) 60 --Cur; 62 assert(Cur->getValPtrInt() == 1 && 64 return reinterpret_cast<MDNode*>(Cur) - 1;
|
/external/llvm/lib/MC/ |
H A D | MCAssembler.cpp | 101 MCFragment *Cur = LastValidFragment[&SD]; local 102 if (!Cur) 103 Cur = &*SD.begin(); 105 Cur = Cur->getNextNode(); 109 assert(Cur && "Layout bookkeeping error"); 110 const_cast<MCAsmLayout*>(this)->layoutFragment(Cur); 111 Cur = Cur->getNextNode();
|
/external/llvm/lib/Option/ |
H A D | ArgList.cpp | 287 StringRef Cur = getArgString(Index); local 288 if (Cur.size() == LHS.size() + RHS.size() && 289 Cur.startswith(LHS) && Cur.endswith(RHS)) 290 return Cur.data();
|
/external/llvm/lib/ProfileData/ |
H A D | InstrProfReader.cpp | 298 const unsigned char *Cur = Start; local 299 if ((const unsigned char *)DataBuffer->getBufferEnd() - Cur < 24) 305 uint64_t Magic = endian::readNext<uint64_t, little, unaligned>(Cur); 310 uint64_t Version = endian::readNext<uint64_t, little, unaligned>(Cur); 315 MaxFunctionCount = endian::readNext<uint64_t, little, unaligned>(Cur); 319 endian::readNext<uint64_t, little, unaligned>(Cur)); 322 uint64_t HashOffset = endian::readNext<uint64_t, little, unaligned>(Cur); 325 Index.reset(InstrProfReaderIndex::Create(Start + HashOffset, Cur, Start,
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMJITInfo.cpp | 145 uint8_t *Cur = Buffer; local 146 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)Ptr);
|
/external/llvm/lib/Target/Sparc/ |
H A D | SparcAsmPrinter.cpp | 100 const MCSymbolRefExpr *Cur = MCSymbolRefExpr::Create(CurLabel, local 103 const MCBinaryExpr *Sub = MCBinaryExpr::CreateSub(Cur, Start, OutContext);
|
/external/llvm/lib/Target/X86/ |
H A D | X86JITInfo.cpp | 454 uint8_t *Cur = Buffer; local 455 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(intptr_t)ptr); 456 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(((intptr_t)ptr) >> 32)); 460 uint8_t *Cur = Buffer; 461 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)ptr);
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LowerSwitch.cpp | 105 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks local 107 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) {
|
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 497 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;
|
/external/llvm/utils/TableGen/ |
H A D | CodeGenInstruction.cpp | 380 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { argument 386 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart) 387 if (Cur[VariantsStart] == '{' && 388 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' && 389 Cur[VariantsStart-1] != '\\'))) 393 Res += Cur.slice(0, VariantsStart); 394 if (VariantsStart == Cur.size()) 402 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) { 403 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/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...] |