| /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/lzma/CPP/7zip/Common/ |
| CWrappers.h | 47 const Byte *Cur;
62 Lim = Cur = Buf;
67 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
71 if (Cur != Lim)
72 return *Cur++;
80 Byte *Cur;
94 Cur = Buf;
99 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
103 *Cur++ = b;
104 if (Cur == Lim)
[all...] |
| CWrappers.cpp | 145 Lim = Cur = Buf = (Byte *)::MidAlloc((size_t)size);
156 Processed += (Cur - Buf);
158 Cur = Buf;
161 return *Cur++;
170 if (p->Cur != p->Lim)
171 return *p->Cur++;
204 size_t size = (Cur - Buf);
208 Cur = Buf;
216 Byte *dest = p->Cur;
218 p->Cur = ++dest;
[all...] |
| /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 | 71 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
72 Cur->registered(E);
106 const node *Cur;
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 != That.Cur;
[all...] |
| /external/clang/lib/AST/ |
| TypeLoc.cpp | 129 TypeLoc Cur = *this;
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;
[all...] |
| Type.cpp | 248 QualType Cur = T;
250 const Type *CurTy = Qs.strip(Cur);
258 Cur = Ty->desugar(); \
315 template<typename T> static const T *getAsSugar(const Type *Cur) {
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;
348 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 | 577 uint16_t Cur = List[i];
578 V.push_back(Cur - Val);
579 Val = Cur;
590 uint16_t Cur = (*I)->EnumValue;
591 V.push_back(Cur - Val);
592 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/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 | 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...] |
| SemaExpr.cpp | 247 void Sema::MaybeSuggestAddingStaticToDecl(const FunctionDecl *Cur) {
248 const FunctionDecl *First = Cur->getFirstDeclaration();
254 << Cur << FixItHint::CreateInsertion(DeclBegin, "static ");
[all...] |
| /external/llvm/lib/Analysis/ |
| TypeBasedAliasAnalysis.cpp | 183 uint64_t Cur = cast<ConstantInt>(Node->getOperand(Idx + 1))->
185 if (Cur > Offset) {
195 uint64_t Cur = cast<ConstantInt>(Node->getOperand(TheIdx + 1))->
197 Offset -= Cur;
|
| /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/Target/ARM/ |
| ARMJITInfo.cpp | 144 uint8_t *Cur = Buffer;
145 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)Ptr);
|
| /external/llvm/lib/Option/ |
| 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/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/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())) {
|
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
