| /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 | 99 TypeLoc Cur = *this;
101 switch (Cur.getTypeLocClass()) {
109 TypeLoc Next = Cur.getNextTypeLoc();
111 Cur = Next;
116 return Cur.getLocalSourceRange().getBegin();
120 TypeLoc Cur = *this;
123 switch (Cur.getTypeLocClass()) {
126 Last = Cur;
135 Last = Cur;
144 Last = Cur;
[all...] |
| Type.cpp | 226 QualType Cur = T;
228 const Type *CurTy = Qs.strip(Cur);
236 Cur = Ty->desugar(); \
294 const Type *Cur = this;
297 switch (Cur->getTypeClass()) {
301 const Class##Type *Ty = cast<Class##Type>(Cur); \
302 if (!Ty->isSugared()) return Cur; \
303 Cur = Ty->desugar().getTypePtr(); \
[all...] |
| /external/clang/tools/driver/ |
| driver.cpp | 431 } else if (const char *Cur = ::getenv("CCC_ADD_ARGS")) {
436 const char *Next = strchr(Cur, ',');
440 std::string(Cur, Next)));
441 Cur = Next + 1;
443 if (*Cur != '\0')
444 ExtraArgs.push_back(SaveStringInSet(SavedStrings, Cur));
|
| /external/llvm/utils/TableGen/ |
| CodeGenInstruction.cpp | 356 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) {
362 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart)
363 if (Cur[VariantsStart] == '{' &&
364 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' &&
365 Cur[VariantsStart-1] != '\\')))
369 Res += Cur.slice(0, VariantsStart);
370 if (VariantsStart == Cur.size())
378 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) {
379 if (Cur[VariantsEnd] == '}' && Cur[VariantsEnd-1] != '\\')
[all...] |
| DAGISelMatcher.cpp | 40 Matcher *Cur = this;
41 for (; Cur && Cur->getNext() != Other; Cur = Cur->getNext())
44 if (Cur == 0) return 0;
45 Cur->takeNext();
46 Cur->setNext(Other->takeNext());
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 228 SUnit *Cur = WorkList.back();
232 for (SUnit::const_pred_iterator I = Cur->Preds.begin(),
233 E = Cur->Preds.end(); I != E; ++I) {
246 if (MaxPredDepth != Cur->Depth) {
247 Cur->setDepthDirty();
248 Cur->Depth = MaxPredDepth;
250 Cur->isDepthCurrent = true;
261 SUnit *Cur = WorkList.back();
265 for (SUnit::const_succ_iterator I = Cur->Succs.begin(),
266 E = Cur->Succs.end(); I != E; ++I)
[all...] |
| /external/clang/lib/Sema/ |
| IdentifierResolver.cpp | 49 IdDeclInfoPool *Cur = CurPool;
50 while (IdDeclInfoPool *P = Cur) {
51 Cur = Cur->Next;
|
| SemaAccess.cpp | 617 bool findFriendship(const CXXRecordDecl *Cur, unsigned PrivateDepth) {
621 if (Cur == NamingClass)
624 if (CheckDependent && MightInstantiateTo(Cur, NamingClass))
629 I = Cur->bases_begin(), E = Cur->bases_end(); I != E; ++I) {
632 // base will not have any access in classes derived from Cur.
661 bool findFriendship(const CXXRecordDecl *Cur) {
663 CurPath.push_back(Cur);
664 return findFriendship(Cur, 0);
[all...] |
| SemaDecl.cpp | [all...] |
| SemaLookup.cpp | [all...] |
| /external/clang/lib/Driver/ |
| ArgList.cpp | 221 StringRef Cur = getArgString(Index);
222 if (Cur.size() == LHS.size() + RHS.size() &&
223 Cur.startswith(LHS) && Cur.endswith(RHS))
224 return Cur.data();
|
| Driver.cpp | 287 StringRef Cur = A->getValue(*Args);
290 while (!Cur.empty()) {
291 std::pair<StringRef, StringRef> Split = Cur.split(',');
303 Cur = Split.second;
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86JITInfo.cpp | 448 uint8_t *Cur = Buffer;
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/tools/llvm-diff/ |
| DifferenceEngine.cpp | 497 DiffEntry *Cur = Paths1.data();
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/lib/VMCore/ |
| DebugLoc.cpp | 250 MDNode *Cur = get();
254 assert(Ctx->ScopeRecordIdx[Cur] == Idx && "Mapping out of date!");
255 Ctx->ScopeRecordIdx.erase(Cur);
|
| /external/llvm/lib/MC/ |
| MCAssembler.cpp | 85 MCFragment *Cur = LastValidFragment[&SD];
86 if (!Cur)
87 Cur = &*SD.begin();
89 Cur = Cur->getNextNode();
93 const_cast<MCAsmLayout*>(this)->LayoutFragment(Cur);
94 Cur = Cur->getNextNode();
|
| /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 | 98 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks
100 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) {
|
