HomeSort by relevance Sort by last modified time
    Searched refs:Ranges (Results 1 - 25 of 32) sorted by null

1 2

  /external/llvm/lib/MC/MCParser/
MCAsmParser.cpp 36 bool MCAsmParser::TokError(const Twine &Msg, ArrayRef<SMRange> Ranges) {
37 Error(getLexer().getLoc(), Msg, Ranges);
AsmParser.cpp 148 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>());
150 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>());
177 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>()) const {
178 SrcMgr.PrintMessage(Loc, Kind, Msg, Ranges);
404 bool AsmParser::Warning(SMLoc L, const Twine &Msg, ArrayRef<SMRange> Ranges) {
406 return Error(L, Msg, Ranges);
407 PrintMessage(L, SourceMgr::DK_Warning, Msg, Ranges);
412 bool AsmParser::Error(SMLoc L, const Twine &Msg, ArrayRef<SMRange> Ranges) {
414 PrintMessage(L, SourceMgr::DK_Error, Msg, Ranges);
    [all...]
  /external/clang/include/clang/Frontend/
TextDiagnostic.h 85 /// \param Ranges The underlined ranges for this code snippet.
88 StringRef Message, ArrayRef<CharSourceRange> Ranges,
129 ArrayRef<CharSourceRange> Ranges);
132 SmallVectorImpl<CharSourceRange>& Ranges,
137 SmallVectorImpl<CharSourceRange>& Ranges,
  /external/llvm/include/llvm/MC/MCParser/
MCAsmParser.h 78 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>()) = 0;
86 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>()) = 0;
97 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>());
  /external/clang/lib/StaticAnalyzer/Checkers/
DereferenceChecker.cpp 36 SmallVectorImpl<SourceRange> &Ranges,
42 SmallVectorImpl<SourceRange> &Ranges,
54 Ranges.push_back(DR->getSourceRange());
63 Ranges.push_back(SourceRange(L, L));
110 SmallVector<SourceRange, 2> Ranges;
122 AddDerefSource(os, Ranges, AE->getBase()->IgnoreParenCasts());
130 AddDerefSource(os, Ranges, U->getSubExpr()->IgnoreParens(), true);
139 AddDerefSource(os, Ranges, M->getBase()->IgnoreParenCasts(), true);
153 Ranges.push_back(IV->getSourceRange());
169 I = Ranges.begin(), E = Ranges.end(); I!=E; ++I
    [all...]
  /external/llvm/lib/Support/
SourceMgr.cpp 145 ArrayRef<SMRange> Ranges) const {
167 // Convert any ranges to column ranges that only intersect the line of the
170 for (unsigned i = 0, e = Ranges.size(); i != e; ++i) {
171 SMRange R = Ranges[i];
184 // Translate from SMLoc ranges to column ranges.
196 const Twine &Msg, ArrayRef<SMRange> Ranges) const {
197 SMDiagnostic Diagnostic = GetMessage(Loc, Kind, Msg, Ranges);
222 ArrayRef<std::pair<unsigned,unsigned> > Ranges)
    [all...]
  /external/llvm/include/llvm/Support/
SourceMgr.h 132 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>()) const;
141 ArrayRef<SMRange> Ranges = ArrayRef<SMRange>()) const;
162 std::vector<std::pair<unsigned, unsigned> > Ranges;
178 ArrayRef<std::pair<unsigned,unsigned> > Ranges);
189 return Ranges;
  /external/llvm/include/llvm/CodeGen/
LiveInterval.h 148 /// These ranges are rendered as [start,end).
200 /// LiveInterval - This class represents some number of live ranges for a
206 typedef SmallVector<LiveRange,4> Ranges;
211 Ranges ranges; // the ranges in which this register is live
228 typedef Ranges::iterator iterator;
229 iterator begin() { return ranges.begin(); }
230 iterator end() { return ranges.end(); }
232 typedef Ranges::const_iterator const_iterator
    [all...]
LexicalScopes.h 121 /// extractLexicalScopes - Extract instruction ranges for each lexical scopes
174 SmallVector<InsnRange, 4> &getRanges() { return Ranges; }
202 Ranges.push_back(InsnRange(FirstInsn, LastInsn));
237 SmallVector<InsnRange, 4> Ranges;
LiveIntervalAnalysis.h 131 /// ranges that stay within a single basic block. Anything else is
448 LiveInterval::Ranges::const_iterator &I,
  /external/llvm/lib/TableGen/
TGParser.h 141 bool ParseOptionalRangeList(std::vector<unsigned> &Ranges);
142 bool ParseOptionalBitList(std::vector<unsigned> &Ranges);
144 bool ParseRangePiece(std::vector<unsigned> &Ranges);
TGParser.cpp 489 bool TGParser::ParseRangePiece(std::vector<unsigned> &Ranges) {
502 Ranges.push_back(Start);
522 Ranges.push_back(Start);
525 Ranges.push_back(Start);
530 /// ParseRangeList - Parse a list of scalars and ranges into scalar values.
553 bool TGParser::ParseOptionalRangeList(std::vector<unsigned> &Ranges) {
561 Ranges = ParseRangeList();
562 if (Ranges.empty()) return true;
575 bool TGParser::ParseOptionalBitList(std::vector<unsigned> &Ranges) {
583 Ranges = ParseRangeList()
    [all...]
  /external/clang/lib/Frontend/
TextDiagnostic.cpp 431 ArrayRef<CharSourceRange> Ranges,
442 emitDiagnosticLoc(Loc, PLoc, Level, Ranges);
454 // Get the ranges into a local array we can hack on.
455 SmallVector<CharSourceRange, 20> MutableRanges(Ranges.begin(),
456 Ranges.end());
577 /// ranges necessary.
580 ArrayRef<CharSourceRange> Ranges) {
629 if (DiagOpts.ShowSourceRanges && !Ranges.empty()) {
634 for (ArrayRef<CharSourceRange>::const_iterator RI = Ranges.begin(),
635 RE = Ranges.end()
    [all...]
ASTUnit.cpp     [all...]
  /external/llvm/lib/Transforms/Scalar/
MemCpyOptimizer.cpp 127 /// two ranges into [0, 3) which is memset'able.
191 /// Ranges - A sorted list of the memset ranges. We use std::list here
193 std::list<MemsetRange> Ranges;
200 const_iterator begin() const { return Ranges.begin(); }
201 const_iterator end() const { return Ranges.end(); }
202 bool empty() const { return Ranges.empty(); }
233 /// existing ranges as appropriate.
235 /// Do a linear search of the ranges to see if this can be joined and/or to
236 /// find the insertion point in the list. We keep the ranges sorted fo
    [all...]
  /external/llvm/lib/CodeGen/
LiveInterval.cpp 40 size_t Len = ranges.size();
53 Ranges::const_iterator r =
54 std::lower_bound(ranges.begin(), ranges.end(), End);
56 // Now r points to the first interval with start >= End, or ranges.end().
57 if (r == ranges.begin())
97 if (i != ranges.begin()) --i;
103 if (j != other.ranges.begin()) --j;
164 /// merge and eliminate all ranges that this will overlap with. The iterator is
166 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, SlotIndex NewEnd)
    [all...]
LiveIntervalAnalysis.cpp 155 if (li.ranges.size() != 1)
157 const LiveRange &range = li.ranges.front();
220 for (LiveInterval::Ranges::const_iterator
221 I = li.ranges.begin(), E = li.ranges.end(); I != E; ++I) {
882 // Move the trimmed ranges back.
883 li->ranges.swap(NewLI.ranges);
    [all...]
  /external/clang/lib/Basic/
Diagnostic.cpp 568 /// | '[' number ',' number ']' -> ranges are inclusive both ends
809 Ranges.reserve(Info.getNumRanges());
811 Ranges.push_back(Info.getRange(I));
820 ArrayRef<CharSourceRange> Ranges,
824 this->Ranges.assign(Ranges.begin(), Ranges.end());
  /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
BugReporter.h 74 SmallVector<SourceRange, 4> Ranges;
132 /// Ranges are used to highlight regions of interest in the source code.
136 /// ranges.
138 assert((R.isValid() || Ranges.empty()) && "Invalid range can only be used "
140 Ranges.push_back(R);
  /external/clang/include/clang/Basic/
Diagnostic.h 595 /// NumRanges - This is the number of ranges in the DiagRanges array.
617 /// DiagRanges - The list of ranges added to this diagnostic. It currently
618 /// only support 10 ranges, could easily be extended if needed.
677 /// and allows insertion of extra information (arguments and source ranges) into
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
RangeConstraintManager.cpp 72 /// RangeSet contains a set of ranges. If the set is empty, then
77 PrimRangeSet ranges; // no need to make const, since it is an member in class:__anon4611::RangeSet
84 RangeSet(PrimRangeSet RS) : ranges(RS) {}
86 iterator begin() const { return ranges.begin(); }
87 iterator end() const { return ranges.end(); }
89 bool isEmpty() const { return ranges.isEmpty(); }
93 : ranges(F.add(F.getEmptySet(), Range(from, to))) {}
97 void Profile(llvm::FoldingSetNodeID &ID) const { ranges.Profile(ID); }
103 return ranges.isSingleton() ? ranges.begin()->getConcreteValue() : 0
    [all...]
BugReporter.cpp 966 // Less accurate: compare using source ranges.
    [all...]
  /external/llvm/lib/CodeGen/AsmPrinter/
DwarfDebug.cpp 256 const SmallVector<InsnRange, 4> &Ranges = Scope->getRanges();
257 if (Ranges.empty())
260 SmallVector<InsnRange, 4>::const_iterator RI = Ranges.begin();
261 if (Ranges.size() > 1) {
268 for (SmallVector<InsnRange, 4>::const_iterator RI = Ranges.begin(),
269 RE = Ranges.end(); RI != RE; ++RI) {
298 const SmallVector<InsnRange, 4> &Ranges = Scope->getRanges();
299 assert (Ranges.empty() == false
312 SmallVector<InsnRange, 4>::const_iterator RI = Ranges.begin();
329 if (Ranges.size() > 1)
    [all...]
  /external/chromium/base/metrics/
histogram.h 268 typedef int Sample; // Used for samples (and ranges of samples).
275 typedef std::vector<Sample> Ranges;
409 // 0x8000 means print ranges in hex.
429 // Check to see if bucket ranges, counts and tallies in the snapshot are
430 // consistent with the bucket ranges and checksums in our histogram. This can
443 virtual Sample ranges(size_t i) const;
566 Ranges ranges_;
568 // For redundancy, we store a checksum of all the sample ranges when ranges
628 // For some ranges, we store a printable description of a bucket range
    [all...]
  /external/chromium/chrome/common/extensions/docs/examples/extensions/imageinfo/imageinfo/
binaryajax.js 206 var strAcceptRanges = oHTTP.getResponseHeader("Accept-Ranges");

Completed in 380 milliseconds

1 2