Searched refs:Cur (Results 1 - 25 of 47) sorted by relevance

12

/external/llvm/lib/Support/
H A Dcircular_raw_ostream.cpp27 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/swiftshader/third_party/LLVM/lib/Support/
H A Dcircular_raw_ostream.cpp27 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/
H A DCWrappers.h52 const Byte *Cur; member in struct:CByteInBufWrap
67 Lim = Cur = Buf;
72 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
76 if (Cur != Lim)
77 return *Cur++;
85 Byte *Cur; member in struct:CByteOutBufWrap
99 Cur = Buf;
104 UInt64 GetProcessed() const { return Processed + (Cur - Buf); }
108 *Cur++ = b;
109 if (Cur
[all...]
H A DCWrappers.cpp149 Lim = Cur = Buf = (Byte *)::MidAlloc((size_t)size);
160 Processed += (Cur - Buf);
162 Cur = Buf;
165 return *Cur++;
174 if (p->Cur != p->Lim)
175 return *p->Cur++;
208 size_t size = (Cur - Buf);
212 Cur = Buf;
220 Byte *dest = p->Cur;
222 p->Cur
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/Support/
H A Dcircular_raw_ostream.h58 /// Cur - Pointer to the current output point in BufferArray.
60 char *Cur; member in class:llvm::circular_raw_ostream
77 TheStream->write(Cur, BufferArray + BufferSize - Cur);
79 TheStream->write(BufferArray, Cur - BufferArray);
80 Cur = BufferArray;
120 Cur = BufferArray;
130 Cur = BufferArray;
H A DRegistry.h69 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
70 Cur->registered(E);
104 const node *Cur; member in class:llvm::Registry::iterator
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 !
[all...]
/external/llvm/include/llvm/Support/
H A Dcircular_raw_ostream.h57 /// Cur - Pointer to the current output point in BufferArray.
59 char *Cur; member in class:llvm::circular_raw_ostream
76 TheStream->write(Cur, BufferArray + BufferSize - Cur);
78 TheStream->write(BufferArray, Cur - BufferArray);
79 Cur = BufferArray;
115 Cur = BufferArray;
H A DRegistry.h83 const node *Cur; member in class:llvm::Registry::iterator
86 explicit iterator(const node *N) : Cur(N) {}
88 bool operator==(const iterator &That) const { return Cur == That.Cur; }
89 bool operator!=(const iterator &That) const { return Cur != That.Cur; }
90 iterator &operator++() { Cur = Cur->Next; return *this; }
91 const entry &operator*() const { return Cur->Val; }
92 const entry *operator->() const { return &Cur
[all...]
/external/llvm/tools/llvm-c-test/
H A Decho.cpp706 LLVMValueRef Cur = First; local
709 CloneInstruction(Cur, Builder);
710 Next = LLVMGetNextInstruction(Cur);
712 if (Cur != Last)
718 if (Prev != Cur)
721 Cur = Next;
736 LLVMBasicBlockRef Cur = First; local
739 CloneBB(Cur);
741 Next = LLVMGetNextBasicBlock(Cur);
743 if (Cur !
764 LLVMValueRef Cur = Begin; local
843 LLVMValueRef Cur = Begin; local
[all...]
/external/clang/lib/AST/
H A DTypeLoc.cpp171 TypeLoc Cur = *this; local
172 TypeLoc LeftMost = Cur;
174 switch (Cur.getTypeLocClass()) {
176 LeftMost = Cur;
179 if (Cur.castAs<FunctionProtoTypeLoc>().getTypePtr()
181 LeftMost = Cur;
192 Cur = Cur.getNextTypeLoc();
195 if (Cur.getLocalSourceRange().getBegin().isValid())
196 LeftMost = Cur;
208 TypeLoc Cur = *this; local
[all...]
/external/llvm/lib/Support/Windows/
H A DProgram.inc154 /// CountPrecedingBackslashes - Returns the number of backslashes preceding Cur
157 const char *Cur) {
159 --Cur;
160 while (Cur >= Start && *Cur == '\\') {
162 --Cur;
168 /// preceding Cur in the Start string. Assumes Dst has enough space.
170 const char *Cur) {
171 unsigned PrecedingEscapes = CountPrecedingBackslashes(Start, Cur);
/external/llvm/lib/Transforms/Utils/
H A DLoopUtils.cpp238 Instruction *Cur = Worklist.back(); local
244 if (Cur->use_empty())
247 bool IsAPhi = isa<PHINode>(Cur);
250 if (Cur != Phi && IsAPhi && Cur->getParent() == Phi->getParent())
255 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) &&
256 !isa<ICmpInst>(Cur) && !isa<FCmpInst>(Cur) &&
257 !VisitedInsts.count(dyn_cast<Instruction>(Cur
[all...]
/external/swiftshader/third_party/LLVM/utils/TableGen/
H A DCodeGenInstruction.cpp356 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { argument
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[VariantsEn
[all...]
H A DDAGISelMatcher.cpp40 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/Analysis/
H A DAliasSetTracker.cpp219 iterator Cur = I++; local
220 if (Cur->Forward || !Cur->aliasesPointer(Ptr, Size, AAInfo, AA)) continue;
223 FoundSet = &*Cur; // Remember it.
225 FoundSet->mergeSetIn(*Cur, *this); // Merge in contents.
253 iterator Cur = I++; local
254 if (Cur->Forward || !Cur->aliasesUnknownInst(Inst, AA))
257 FoundSet = &*Cur; // Remember it.
258 else if (!Cur
561 iterator Cur = I++; local
[all...]
H A DTypeBasedAliasAnalysis.cpp234 uint64_t Cur = Node->getNumOperands() == 2 local
238 Offset -= Cur;
249 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(Idx + 1)) local
251 if (Cur > Offset) {
261 uint64_t Cur = mdconst::extract<ConstantInt>(Node->getOperand(TheIdx + 1)) local
263 Offset -= Cur;
/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp238 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
[all...]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DScheduleDAG.cpp228 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
[all...]
/external/llvm/utils/TableGen/
H A DDAGISelMatcher.cpp42 Matcher *Cur = this;
43 for (; Cur && Cur->getNext() != Other; Cur = Cur->getNext())
46 if (!Cur) return nullptr;
47 Cur->takeNext();
48 Cur->setNext(Other->takeNext());
H A DCodeGenInstruction.cpp387 FlattenAsmStringVariants(StringRef Cur, unsigned Variant) { argument
393 for (size_t e = Cur.size(); VariantsStart != e; ++VariantsStart)
394 if (Cur[VariantsStart] == '{' &&
395 (VariantsStart == 0 || (Cur[VariantsStart-1] != '$' &&
396 Cur[VariantsStart-1] != '\\')))
400 Res += Cur.slice(0, VariantsStart);
401 if (VariantsStart == Cur.size())
409 for (size_t e = Cur.size(); VariantsEnd != e; ++VariantsEnd) {
410 if (Cur[VariantsEnd] == '}' && Cur[VariantsEn
[all...]
/external/llvm/lib/Fuzzer/
H A DFuzzerTraceState.cpp392 for (const uint8_t *Cur = Beg; Cur < End; Cur++) {
393 Cur = (uint8_t *)memmem(Cur, End - Cur, &PresentData, DataSize);
394 if (!Cur)
396 size_t Pos = Cur - Beg;
415 for (const uint8_t *Cur = Beg; Cur < En
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDIEHash.cpp88 const DIE *Cur = &Parent; local
89 while (Cur->getParent()) {
90 Parents.push_back(Cur);
91 Cur = Cur->getParent();
93 assert(Cur->getTag() == dwarf::DW_TAG_compile_unit ||
94 Cur->getTag() == dwarf::DW_TAG_type_unit);
/external/swiftshader/third_party/LLVM/lib/Target/X86/
H A DX86JITInfo.cpp442 uint8_t *Cur = Buffer; local
443 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(intptr_t)ptr);
444 MachineCodeEmitter::emitWordLEInto(Cur, (unsigned)(((intptr_t)ptr) >> 32));
448 uint8_t *Cur = Buffer;
449 MachineCodeEmitter::emitWordLEInto(Cur, (intptr_t)ptr);
/external/llvm/tools/llvm-diff/
H A DDifferenceEngine.cpp497 DiffEntry *Cur = Paths1.data(); local
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/swiftshader/third_party/LLVM/tools/llvm-diff/
H A DDifferenceEngine.cpp497 DiffEntry *Cur = Paths1.data(); local
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;

Completed in 1290 milliseconds

12