| /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;
116 Cur = BufferArray;
|
| Registry.h | 73 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
74 Cur->registered(E);
108 const node *Cur;
111 explicit iterator(const node *N) : Cur(N) {}
113 bool operator==(const iterator &That) const { return Cur == That.Cur; }
114 bool operator!=(const iterator &That) const { return Cur != That.Cur;
[all...] |
| /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 | 240 QualType Cur = T;
242 const Type *CurTy = Qs.strip(Cur);
250 Cur = Ty->desugar(); \
307 template<typename T> static const T *getAsSugar(const Type *Cur) {
309 if (const T *Sugar = dyn_cast<T>(Cur))
311 switch (Cur->getTypeClass()) {
315 const Class##Type *Ty = cast<Class##Type>(Cur); \
317 Cur = Ty->desugar().getTypePtr(); \
341 const Type *Cur = this;
344 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/CodeGen/AsmPrinter/ |
| DIEHash.cpp | 95 const DIE *Cur = &Parent;
96 while (Cur->getParent()) {
97 Parents.push_back(Cur);
98 Cur = Cur->getParent();
100 assert(Cur->getTag() == dwarf::DW_TAG_compile_unit ||
101 Cur->getTag() == dwarf::DW_TAG_type_unit);
|
| DwarfDebug.cpp | [all...] |
| /external/llvm/lib/Option/ |
| ArgList.cpp | 311 StringRef Cur = getArgString(Index);
312 if (Cur.size() == LHS.size() + RHS.size() &&
313 Cur.startswith(LHS) && Cur.endswith(RHS))
314 return Cur.data();
|
| /external/llvm/lib/ProfileData/ |
| InstrProfReader.cpp | 318 const unsigned char *Cur = Start;
319 if ((const unsigned char *)DataBuffer->getBufferEnd() - Cur < 24)
325 uint64_t Magic = endian::readNext<uint64_t, little, unaligned>(Cur);
330 FormatVersion = endian::readNext<uint64_t, little, unaligned>(Cur);
335 MaxFunctionCount = endian::readNext<uint64_t, little, unaligned>(Cur);
339 endian::readNext<uint64_t, little, unaligned>(Cur));
342 uint64_t HashOffset = endian::readNext<uint64_t, little, unaligned>(Cur);
345 Index.reset(InstrProfReaderIndex::Create(Start + HashOffset, Cur, Start,
|
| /external/llvm/lib/Analysis/ |
| AliasSetTracker.cpp | 229 iterator Cur = I++;
230 if (Cur->Forward || !Cur->aliasesPointer(Ptr, Size, AAInfo, AA)) continue;
233 FoundSet = Cur; // Remember it.
235 FoundSet->mergeSetIn(*Cur, *this); // Merge in contents.
263 iterator Cur = I++;
264 if (Cur->Forward || !Cur->aliasesUnknownInst(Inst, AA))
267 FoundSet = Cur; // Remember it.
268 else if (!Cur->Forward) // Otherwise, we must merge the sets
[all...] |
| TypeBasedAliasAnalysis.cpp | 237 uint64_t Cur = Node->getNumOperands() == 2
241 Offset -= Cur;
252 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(Idx + 1))
254 if (Cur > Offset) {
264 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(TheIdx + 1))
266 Offset -= Cur;
|
| /external/llvm/lib/Target/Sparc/ |
| SparcAsmPrinter.cpp | 100 const MCSymbolRefExpr *Cur = MCSymbolRefExpr::Create(CurLabel,
103 const MCBinaryExpr *Sub = MCBinaryExpr::CreateSub(Cur, Start, OutContext);
|
| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 121 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks
123 if (SwitchInst *SI = dyn_cast<SwitchInst>(Cur->getTerminator())) {
|
| /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/utils/TableGen/ |
| RegisterInfoEmitter.cpp | 580 for (uint16_t Cur : List) {
581 V.push_back(Cur - Val);
582 Val = Cur;
593 uint16_t Cur = (*I)->EnumValue;
594 V.push_back(Cur - Val);
595 Val = Cur;
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 306 IntervalInfo Cur = Inactive.top();
308 // Retire any active intervals that end before Cur starts.
311 (getEndPoint(*RetireItr) <= getStartPoint(Cur))) {
322 // Cur segment, so re-grab the front of the inactive list.
323 Cur = Inactive.top();
326 // At this point we know that Cur overlaps all active intervals. Add the
328 PBQP::GraphBase::NodeId NId = getNodeId(Cur);
349 // Finally, add Cur to the Active set.
350 Active.insert(Cur);
|
| /external/llvm/lib/MC/ |
| MCAssembler.cpp | 102 MCFragment *Cur = LastValidFragment[&SD];
103 if (!Cur)
104 Cur = &*SD.begin();
106 Cur = Cur->getNextNode();
110 assert(Cur && "Layout bookkeeping error");
111 const_cast<MCAsmLayout*>(this)->layoutFragment(Cur);
112 Cur = Cur->getNextNode();
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
