Searched defs:Last (Results 1 - 25 of 71) sorted by relevance

123

/external/clang/include/clang/Basic/
H A DAddressSpaces.h39 Last, enumerator in enum:clang::LangAS::ID
40 Count = Last-Offset
/external/llvm/tools/dsymutil/
H A DNonRelocatableStringpool.h32 : CurrentEndOffset(0), Sentinel(0), Last(&Sentinel) {
65 MapTy::MapEntryTy Sentinel, *Last; member in class:llvm::dsymutil::NonRelocatableStringpool
/external/clang/lib/Format/
H A DAffectedRangeManager.cpp35 FormatToken *Last = Line->Last; local
38 Last = (*PPEnd)->Last;
42 if (affectsTokenRange(*Line->First, *Last,
73 const FormatToken &Last,
78 SourceLocation End = Last.getStartOfNonWhitespace();
79 End = End.getLocWithOffset(Last.TokenText.size());
139 PreviousLine->Affected && PreviousLine->Last->is(tok::comment);
72 affectsTokenRange(const FormatToken &First, const FormatToken &Last, bool IncludeLeadingNewlines) argument
H A DTokenAnnotator.h67 Last = Current;
68 Last->Next = nullptr;
94 return Last && Last->endsSequence(Tokens...);
101 // FIXME: Line.Last points to other characters than tok::semi
103 return !Last->isOneOf(tok::semi, tok::comment);
107 FormatToken *Last; member in class:clang::format::AnnotatedLine
/external/clang/lib/StaticAnalyzer/Checkers/
H A DCastSizeChecker.cpp58 const FieldDecl *Last = nullptr; local
60 Last = *Iter;
61 assert(Last && "empty structs should already be handled");
63 const Type *ElemType = Last->getType()->getArrayElementTypeNoTypeQual();
66 Ctx.getAsConstantArrayType(Last->getType())) {
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3-inl.h109 QueueNode<E>* Last() { return last_; } function in class:Queue
110 const QueueNode<E>* Last() const { return last_; } function in class:Queue
/external/googletest/googletest/samples/
H A Dsample3-inl.h109 QueueNode<E>* Last() { return last_; } function in class:Queue
110 const QueueNode<E>* Last() const { return last_; } function in class:Queue
/external/llvm/lib/Analysis/
H A DScalarEvolutionAliasAnalysis.cpp102 const SCEV *Last = A->getOperand(A->getNumOperands() - 1); local
103 if (Last->getType()->isPointerTy())
104 return GetBaseValue(Last);
/external/llvm/lib/Target/PowerPC/
H A DPPCTLSDynamicCall.cpp124 MachineBasicBlock::iterator Last = I; local
125 --Last;
132 LIS->repairIntervalsInRange(&MBB, First, Last, OrigRegs);
/external/protobuf/gtest/samples/
H A Dsample3-inl.h110 QueueNode<E>* Last() { return last_; } function in class:Queue
111 const QueueNode<E>* Last() const { return last_; } function in class:Queue
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DScalarEvolutionAliasAnalysis.cpp97 const SCEV *Last = A->getOperand(A->getNumOperands()-1); local
98 if (Last->getType()->isPointerTy())
99 return GetBaseValue(Last);
/external/v8/testing/gtest/samples/
H A Dsample3-inl.h109 QueueNode<E>* Last() { return last_; } function in class:Queue
110 const QueueNode<E>* Last() const { return last_; } function in class:Queue
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
H A Dsample3-inl.h109 QueueNode<E>* Last() { return last_; } function in class:Queue
110 const QueueNode<E>* Last() const { return last_; } function in class:Queue
/external/clang/utils/TableGen/
H A DClangASTNodesEmitter.cpp80 Record *First = nullptr, *Last = nullptr; local
84 First = Last = Base;
109 Last = Result.second;
112 Last = R;
123 assert (Last && "Got a first node but not a last node for a range!");
129 << Last->getName() << ")\n\n";
132 return std::make_pair(First, Last);
145 << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n";
150 << macroName(Root.getName()) << "_RANGE(Base, First, Last) "
151 << macroName(Root.getName()) << "_RANGE(Base, First, Last)\
[all...]
/external/clang/lib/AST/
H A DTypeLoc.cpp209 TypeLoc Last; local
213 if (!Last)
214 Last = Cur;
215 return Last.getLocalSourceRange().getEnd();
222 Last = Cur;
226 Last = TypeLoc();
228 Last = Cur;
236 if (!Last)
237 Last = Cur;
/external/clang/lib/ASTMatchers/Dynamic/
H A DDiagnostics.cpp69 ErrorContent &Last = Errors.back(); local
70 Last.ContextStack = ContextStack;
71 Last.Messages.emplace_back();
72 Last.Messages.back().Range = Range;
73 Last.Messages.back().Type = Error;
74 return ArgStream(&Last.Messages.back().Args);
/external/llvm/lib/CodeGen/
H A DInterferenceCache.h35 SlotIndex Last; member in struct:llvm::InterferenceCache::BlockInterference
229 return Current->Last;
H A DVirtRegMap.cpp253 SlotIndex Last; local
258 if (!Last.isValid() || SR.segments.back().end > Last)
259 Last = SR.segments.back().end;
262 // Check all mbb start positions between First and Last while
265 MBBI != Indexes->MBBIndexEnd() && MBBI->first <= Last; ++MBBI) {
/external/llvm/lib/DebugInfo/PDB/Raw/
H A DMappedBlockStream.cpp128 uint32_t Last = First; local
131 while (Last < Pdb.getBlockCount() - 1) {
132 if (BlockList[Last] != BlockList[Last + 1] - 1)
134 ++Last;
139 uint32_t BlockSpan = Last - First + 1;
/external/llvm/lib/IR/
H A DAttributeImpl.h265 const std::pair<unsigned, AttributeSetNode *> &Last = Slots.back(); local
266 if (Last.first == AttributeSet::FunctionIndex) {
267 const AttributeSetNode *Node = Last.second;
/external/llvm/lib/Target/AArch64/
H A DAArch64AddressTypePromotion.cpp451 Value *Last; local
457 Last = Inst->getOperand(OpdIdx);
458 Inst = dyn_cast<Instruction>(Last);
461 DEBUG(dbgs() << "Head of the chain:\n" << *Last << '\n');
463 SeenChains.find(Last);
470 SeenChains[Last] = nullptr;
474 SeenChains[Last] = SExt;
/external/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.h129 IndexType First, Last; member in class:llvm::HexagonBlockRanges::IndexType::InstrIndexMap
/external/llvm/lib/Target/Lanai/
H A DLanaiMemAluCombiner.cpp337 MbbIterator Last = Decrement ? BB->begin() : BB->end(); local
339 while (First != Last) {
351 if (First != Last) {
/external/llvm/lib/Target/Mips/MCTargetDesc/
H A DMipsELFObjectWriter.cpp66 /// Copy elements in the range [First, Last) to d1 when the predicate is true or
70 std::pair<OutputIt1, OutputIt2> copy_if_else(InputIt First, InputIt Last, argument
73 for (InputIt I = First; I != Last; ++I) {
94 /// Find the best match in the range [First, Last).
104 InputIt find_best(InputIt First, InputIt Last, UnaryPredicate Predicate, argument
106 InputIt Best = Last;
108 for (InputIt I = First; I != Last; ++I) {
113 if (Best == Last || BetterThan(*I, *Best)) {
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DInterferenceCache.h33 SlotIndex Last; member in struct:llvm::InterferenceCache::BlockInterference
196 return Current->Last;

Completed in 1961 milliseconds

123