/external/llvm/lib/Support/ |
circular_raw_ostream.cpp | 27 std::min(unsigned(Size), unsigned(BufferSize - (Cur - BufferArray))); 28 memcpy(Cur, Ptr, Bytes); 30 Cur += Bytes; 31 if (Cur == BufferArray + BufferSize) { 33 Cur = BufferArray;
|
/external/llvm/include/llvm/Support/ |
circular_raw_ostream.h | 58 /// Cur - Pointer to the current output point in BufferArray. 60 char *Cur; 77 TheStream->write(Cur, BufferArray + BufferSize - Cur); 79 TheStream->write(BufferArray, Cur - BufferArray); 80 Cur = BufferArray; 120 Cur = BufferArray; 130 Cur = BufferArray;
|
Registry.h | 69 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) 70 Cur->registered(E); 104 const node *Cur; 107 explicit iterator(const node *N) : Cur(N) {} 109 bool operator==(const iterator &That) const { return Cur == That.Cur; } 110 bool operator!=(const iterator &That) const { return Cur != That.Cur; [all...] |
/external/clang/lib/AST/ |
TypeLoc.cpp | 100 TypeLoc Cur = *this; 102 switch (Cur.getTypeLocClass()) { 110 TypeLoc Next = Cur.getNextTypeLoc(); 112 Cur = Next; 117 return Cur.getLocalSourceRange().getBegin(); 121 TypeLoc Cur = *this; 124 switch (Cur.getTypeLocClass()) { 127 Last = Cur; 136 Last = Cur; 145 Last = Cur; [all...] |
Type.cpp | 227 QualType Cur = T; 229 const Type *CurTy = Qs.strip(Cur); 237 Cur = Ty->desugar(); \ 294 const Type *Cur = this; 297 if (const TypedefType *TDT = dyn_cast<TypedefType>(Cur)) 299 switch (Cur->getTypeClass()) { 303 const Class##Type *Ty = cast<Class##Type>(Cur); \ 305 Cur = Ty->desugar().getTypePtr(); \ 317 const Type *Cur = this; 320 switch (Cur->getTypeClass()) [all...] |
/external/clang/tools/driver/ |
driver.cpp | 451 } else if (const char *Cur = ::getenv("CCC_ADD_ARGS")) { 456 const char *Next = strchr(Cur, ','); 460 std::string(Cur, Next))); 461 Cur = Next + 1; 463 if (*Cur != '\0') 464 ExtraArgs.push_back(SaveStringInSet(SavedStrings, Cur));
|
/external/llvm/utils/TableGen/ |
CodeGenInstruction.cpp | 361 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { 367 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart) 368 if (Cur[VariantsStart] == '{' && 369 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' && 370 Cur[VariantsStart-1] != '\\'))) 374 Res += Cur.slice(0, VariantsStart); 375 if (VariantsStart == Cur.size()) 383 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) { 384 if (Cur[VariantsEnd] == '}' && Cur[VariantsEnd-1] != '\\') [all...] |
DAGISelMatcher.cpp | 42 Matcher *Cur = this; 43 for (; Cur && Cur->getNext() != Other; Cur = Cur->getNext()) 46 if (Cur == 0) return 0; 47 Cur->takeNext(); 48 Cur->setNext(Other->takeNext());
|
RegisterInfoEmitter.cpp | 509 uint16_t Cur = List[i]; 510 V.push_back(Cur - Val); 511 Val = Cur; 522 uint16_t Cur = (*I)->EnumValue; 523 V.push_back(Cur - Val); 524 Val = Cur; [all...] |
/external/llvm/lib/CodeGen/ |
ScheduleDAG.cpp | 222 SUnit *Cur = WorkList.back(); 226 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), 227 E = Cur->Preds.end(); I != E; ++I) { 240 if (MaxPredDepth != Cur->Depth) { 241 Cur->setDepthDirty(); 242 Cur->Depth = MaxPredDepth; 244 Cur->isDepthCurrent = true; 255 SUnit *Cur = WorkList.back(); 259 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), 260 E = Cur->Succs.end(); I != E; ++I) [all...] |
/external/llvm/lib/Target/X86/ |
X86JITInfo.cpp | 453 uint8_t *Cur = Buffer; 454 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(intptr_t)ptr); 455 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(((intptr_t)ptr) >> 32)); 459 uint8_t *Cur = Buffer; 460 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)ptr);
|
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 501 DiffEntry *Cur = Paths1.data(); 512 Cur[I].Cost = I * LeftCost; 514 Cur[I].Path.push_back(DC_left); 519 Next[0] = Cur[0]; 526 Next[Index] = Cur[Index-1]; 530 } else if (Next[Index-1].Cost <= Cur[Index].Cost) { 535 Next[Index] = Cur[Index]; 541 std::swap(Cur, Next); 548 SmallVectorImpl<char> &Path = Cur[NL].Path;
|
/external/clang/lib/Sema/ |
IdentifierResolver.cpp | 52 IdDeclInfoPool *Cur = CurPool; 53 while (IdDeclInfoPool *P = Cur) { 54 Cur = Cur->Next;
|
SemaAccess.cpp | 632 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) { 636 if (Cur == NamingClass) 639 if (CheckDependent && MightInstantiateTo(Cur, NamingClass)) 644 I = Cur->bases_begin(), E = Cur->bases_end(); I != E; ++I) { 647 // base will not have any access in classes derived from Cur. 676 bool findFriendship(const CXXRecordDecl *Cur) { 678 CurPath.push_back(Cur); 679 return findFriendship(Cur, 0); [all...] |
SemaDecl.cpp | [all...] |
/external/llvm/lib/VMCore/ |
DebugLoc.cpp | 221 MDNode *Cur = get(); 225 assert(Ctx->ScopeRecordIdx[Cur] == Idx && "Mapping out of date!"); 226 Ctx->ScopeRecordIdx.erase(Cur);
|
Metadata.cpp | 56 MDNodeOperand *Cur = this; 58 while (Cur->getValPtrInt() != 1) 59 --Cur; 61 assert(Cur->getValPtrInt() == 1 && 63 return reinterpret_cast<MDNode*>(Cur) - 1;
|
/external/clang/lib/Driver/ |
ArgList.cpp | 303 StringRef Cur = getArgString(Index); 304 if (Cur.size() == LHS.size() + RHS.size() && 305 Cur.startswith(LHS) && Cur.endswith(RHS)) 306 return Cur.data();
|
Driver.cpp | 297 StringRef Cur = A->getValue(*Args); 300 while (!Cur.empty()) { 301 std::pair<StringRef, StringRef> Split = Cur.split(','); 313 Cur = Split.second; [all...] |
/external/llvm/lib/MC/ |
MCAssembler.cpp | 86 MCFragment *Cur = LastValidFragment[&SD]; 87 if (!Cur) 88 Cur = &*SD.begin(); 90 Cur = Cur->getNextNode(); 94 const_cast<MCAsmLayout*>(this)->LayoutFragment(Cur); 95 Cur = Cur->getNextNode(); [all...] |
/external/llvm/lib/Target/ARM/ |
ARMJITInfo.cpp | 145 uint8_t *Cur = Buffer; 146 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)Ptr);
|
/external/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 86 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks 88 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) {
|