/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 | 101 TypeLoc Cur = *this; 102 TypeLoc LeftMost = Cur; 104 switch (Cur.getTypeLocClass()) { 106 LeftMost = Cur; 109 if (Cur.castAs<FunctionProtoTypeLoc>().getTypePtr() 111 LeftMost = Cur; 122 Cur = Cur.getNextTypeLoc(); 125 if (!Cur.getLocalSourceRange().getBegin().isInvalid()) 126 LeftMost = Cur; [all...] |
Type.cpp | 247 QualType Cur = T; 249 const Type *CurTy = Qs.strip(Cur); 257 Cur = Ty->desugar(); \ 314 template<typename T> static const T *getAsSugar(const Type *Cur) { 316 if (const T *Sugar = dyn_cast<T>(Cur)) 318 switch (Cur->getTypeClass()) { 322 const Class##Type *Ty = cast<Class##Type>(Cur); \ 324 Cur = Ty->desugar().getTypePtr(); \ 344 const Type *Cur = this; 347 switch (Cur->getTypeClass()) [all...] |
/external/llvm/utils/TableGen/ |
CodeGenInstruction.cpp | 362 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { 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[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 | 573 uint16_t Cur = List[i]; 574 V.push_back(Cur - Val); 575 Val = Cur; 586 uint16_t Cur = (*I)->EnumValue; 587 V.push_back(Cur - Val); 588 Val = Cur; [all...] |
/external/llvm/lib/CodeGen/ |
ScheduleDAG.cpp | 238 SUnit *Cur = WorkList.back(); 242 for (SUnit::const_pred_iterator I = Cur->Preds.begin(), 243 E = Cur->Preds.end(); I != E; ++I) { 256 if (MaxPredDepth != Cur->Depth) { 257 Cur->setDepthDirty(); 258 Cur->Depth = MaxPredDepth; 260 Cur->isDepthCurrent = true; 271 SUnit *Cur = WorkList.back(); 275 for (SUnit::const_succ_iterator I = Cur->Succs.begin(), 276 E = Cur->Succs.end(); I != E; ++I) [all...] |
/external/clang/tools/driver/ |
driver.cpp | 381 } else if (const char *Cur = ::getenv("CCC_ADD_ARGS")) { 386 const char *Next = strchr(Cur, ','); 390 std::string(Cur, Next))); 391 Cur = Next + 1; 393 if (*Cur != '\0') 394 ExtraArgs.push_back(SaveStringInSet(SavedStrings, Cur));
|
/external/llvm/lib/Target/X86/ |
X86JITInfo.cpp | 447 uint8_t *Cur = Buffer; 448 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(intptr_t)ptr); 449 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(((intptr_t)ptr) >> 32)); 453 uint8_t *Cur = Buffer; 454 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)ptr);
|
/external/llvm/tools/llvm-diff/ |
DifferenceEngine.cpp | 499 DiffEntry *Cur = Paths1.data(); 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/clang/lib/Sema/ |
IdentifierResolver.cpp | 51 IdDeclInfoPool *Cur = CurPool; 52 while (IdDeclInfoPool *P = Cur) { 53 Cur = Cur->Next;
|
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) { 687 CurPath.push_back(Cur); 688 return findFriendship(Cur, 0); [all...] |
SemaDecl.cpp | [all...] |
/external/llvm/lib/IR/ |
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/llvm/lib/Option/ |
ArgList.cpp | 286 StringRef Cur = getArgString(Index); 287 if (Cur.size() == LHS.size() + RHS.size() && 288 Cur.startswith(LHS) && Cur.endswith(RHS)) 289 return Cur.data();
|
/external/llvm/lib/MC/ |
MCAssembler.cpp | 99 MCFragment *Cur = LastValidFragment[&SD]; 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(); [all...] |
/external/llvm/lib/Target/ARM/ |
ARMJITInfo.cpp | 144 uint8_t *Cur = Buffer; 145 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)Ptr);
|
/external/clang/lib/Driver/ |
ArgList.cpp | 301 StringRef Cur = getArgString(Index); 302 if (Cur.size() == LHS.size() + RHS.size() && 303 Cur.startswith(LHS) && Cur.endswith(RHS)) 304 return Cur.data();
|
/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())) {
|