HomeSort by relevance Sort by last modified time
    Searched defs:Cur (Results 1 - 17 of 17) sorted by null

  /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/llvm/lib/Target/ARM/
ARMJITInfo.cpp 144 uint8_t *Cur = Buffer;
145 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)Ptr);
  /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...]
  /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/clang/lib/Sema/
IdentifierResolver.cpp 51 IdDeclInfoPool *Cur = CurPool;
52 while (IdDeclInfoPool *P = Cur) {
53 Cur = Cur->Next;
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 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/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/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/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/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/llvm/utils/TableGen/
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/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...]

Completed in 1088 milliseconds