HomeSort by: relevance | last modified time | path
    Searched refs:Ranges (Results 1 - 25 of 214) sorted by relevancy

1 2 3 4 5 6 7 8 9

  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
UnicodeCharRanges.h 1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
45 /// Array pointed by \p Ranges should have the lifetime at least as long as
48 /// instances per each array of ranges, as possible.
55 constexpr UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {}
57 UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {
65 return std::binary_search(Ranges.begin(), Ranges.end(), C)
    [all...]
SourceMgr.h 190 ArrayRef<SMRange> Ranges = {},
196 ArrayRef<SMRange> Ranges = {},
213 ArrayRef<SMRange> Ranges = {},
259 std::vector<std::pair<unsigned, unsigned>> Ranges;
272 ArrayRef<std::pair<unsigned, unsigned>> Ranges,
283 ArrayRef<std::pair<unsigned, unsigned>> getRanges() const { return Ranges; }
  /src/external/apache2/llvm/dist/clang/lib/Format/
AffectedRangeManager.h 10 /// AffectedRangeManager class manages affected ranges in the code.
28 const ArrayRef<CharSourceRange> Ranges)
29 : SourceMgr(SourceMgr), Ranges(Ranges.begin(), Ranges.end()) {}
36 // Returns true if 'Range' intersects with one of the input ranges.
41 // input ranges.
45 // Returns true if one of the input ranges intersect the leading empty lines
59 const SmallVector<CharSourceRange, 8> Ranges;
SortJavaScriptImports.h 29 ArrayRef<tooling::Range> Ranges,
FormatInternal.h 25 /// Reformats the given \p Ranges in the code fragment \p Code.
63 /// * P.first are the ``Replacements`` necessary to make all \p Ranges comply
73 ArrayRef<tooling::Range> Ranges, unsigned FirstStartColumn,
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/
Range.cpp 24 auto It = llvm::upper_bound(Ranges, Range);
26 while (It2 != Ranges.end() && It2->Start < Range.End)
30 It = Ranges.erase(It, It2);
32 if (It != Ranges.begin() && Range.Start < It[-1].End)
35 Ranges.insert(It, Range);
40 Ranges.begin(), Ranges.end(),
42 return It != Ranges.begin() && Addr < It[-1].End;
49 Ranges.begin(), Ranges.end()
    [all...]
InlineInfo.cpp 25 for (auto Range : II.Ranges) {
41 if (II.Ranges.contains(Addr)) {
66 /// objects where the addres ranges isn't contained in the InlineInfo object
74 /// \param SkippedRanges If true, address ranges have already been skipped.
112 Inline.Ranges.decode(Data, BaseAddr, Offset);
113 if (Inline.Ranges.empty())
117 if (!Inline.Ranges.contains(Addr)) {
129 // Child address ranges are encoded relative to the first address in the
131 const auto ChildBaseAddr = Inline.Ranges[0].Start;
153 SrcLocs.back().Offset = Addr - Inline.Ranges[0].Start
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/GSYM/
Range.h 57 /// ranges to be efficiently encoded using ULEB128 encodings as we encode the
79 /// insertions and searches efficiently. The address ranges are always sorted
80 /// and never contain any invalid or empty address ranges. This allows us to
81 /// emit address ranges into the GSYM file efficiently. Intersecting address
82 /// ranges are combined during insertion so that we can emit the most compact
83 /// representation for address ranges when writing to disk.
87 Collection Ranges;
89 void clear() { Ranges.clear(); }
90 bool empty() const { return Ranges.empty(); }
95 size_t size() const { return Ranges.size();
    [all...]
InlineInfo.h 28 /// an array of address ranges. It also stores the call file and call line
32 /// "Children" variable. All address ranges must be sorted and all address
33 /// ranges of all children must be contained in the ranges of this function.
34 /// Any clients that encode information will need to ensure the ranges are
35 /// all contined correctly or lookups could fail. Add ranges in these objects
36 /// must be contained in the top level FunctionInfo address ranges as well.
40 /// When saved to disk, the inline info encodes all ranges to be relative to
43 /// address of the containing parent InlineInfo's first "Ranges" member. This
44 /// allows address ranges to be efficiently encoded using ULEB128 encodings a
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Frontend/
TextDiagnostic.h 78 ArrayRef<CharSourceRange> Ranges,
83 ArrayRef<CharSourceRange> Ranges) override;
86 SmallVectorImpl<CharSourceRange> &Ranges,
88 emitSnippetAndCaret(Loc, Level, Ranges, Hints);
103 SmallVectorImpl<CharSourceRange> &Ranges,
DiagnosticRenderer.h 79 ArrayRef<CharSourceRange> Ranges,
84 ArrayRef<CharSourceRange> Ranges) = 0;
88 SmallVectorImpl<CharSourceRange> &Ranges,
111 ArrayRef<CharSourceRange> Ranges, ArrayRef<FixItHint> Hints);
114 ArrayRef<CharSourceRange> Ranges);
116 ArrayRef<CharSourceRange> Ranges,
130 /// \param Ranges The underlined ranges for this code snippet.
133 StringRef Message, ArrayRef<CharSourceRange> Ranges,
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/
DWARFVerifier.h 40 std::vector<DWARFAddressRange> Ranges;
49 DieRangeInfo(std::vector<DWARFAddressRange> Ranges)
50 : Ranges(std::move(Ranges)) {}
58 /// address ranges will be unioned together in "Ranges".
60 /// This is used for finding overlapping ranges in the DW_AT_ranges
61 /// attribute of a DIE. It is also used as a set of address ranges that
62 /// children address ranges must all be contained in.
65 /// Finds an address range in the sorted vector of ranges
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Testing/Support/
Annotations.cpp 51 Ranges[OpenRanges.back().first].push_back(R);
83 auto I = Ranges.find(Name);
84 require(I != Ranges.end() && I->getValue().size() == 1,
90 Annotations::ranges(llvm::StringRef Name) const { function in class:Annotations
91 auto I = Ranges.find(Name);
92 if (I == Ranges.end())
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
DereferenceChecker.cpp 48 SmallVectorImpl<SourceRange> &Ranges,
57 SmallVectorImpl<SourceRange> &Ranges,
71 Ranges.push_back(DR->getSourceRange());
80 Ranges.push_back(SourceRange(L, L));
88 Ranges.push_back(SourceRange(L, L));
149 SmallVector<SourceRange, 2> Ranges;
155 AddDerefSource(os, Ranges, AE->getBase()->IgnoreParenCasts(),
163 AddDerefSource(os, Ranges, AE->getBase()->IgnoreParenCasts(),
171 AddDerefSource(os, Ranges, U->getSubExpr()->IgnoreParens(),
179 AddDerefSource(os, Ranges, M->getBase()->IgnoreParenCasts()
    [all...]
MallocSizeofChecker.cpp 230 SmallVector<SourceRange, 4> Ranges;
231 Ranges.push_back(i->AllocCall->getCallee()->getSourceRange());
232 Ranges.push_back(SFinder.Sizeofs[0]->getSourceRange());
234 Ranges.push_back(TSI->getTypeLoc().getSourceRange());
241 categories::UnixAPI, OS.str(), L, Ranges);
  /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/test/
multiple_ranges_test.cc 32 std::vector<int64_t> ranges = {state.range(0), state.range(1), local
35 assert(expectedValues.find(ranges) != expectedValues.end());
37 actualValues.insert(ranges);
79 ->Ranges({{1, 2}, {3, 7}, {5, 15}})
89 BENCHMARK(BM_CheckDefaultArgument)->Ranges({{1, 5}, {6, 10}});
95 BENCHMARK(BM_MultipleRanges)->Ranges({{5, 5}, {6, 6}});
  /src/external/apache2/llvm/dist/llvm/utils/benchmark/test/
multiple_ranges_test.cc 32 std::vector<int64_t> ranges = {state.range(0), state.range(1), local
35 assert(expectedValues.find(ranges) != expectedValues.end());
37 actualValues.insert(ranges);
79 ->Ranges({{1, 2}, {3, 7}, {5, 15}})
89 BENCHMARK(BM_CheckDefaultArgument)->Ranges({{1, 5}, {6, 10}});
95 BENCHMARK(BM_MultipleRanges)->Ranges({{5, 5}, {6, 6}});
  /src/external/apache2/llvm/dist/clang/tools/clang-refactor/
TestSupport.h 46 /// Clang-refactor will expected all ranges in one test group to produce
52 /// A set of test selection ranges specified in one file.
57 SmallVector<TestSelectionRange, 8> Ranges;
69 /// Extracts the grouped selection ranges from the file that's specified in
72 /// The grouped ranges are specified in comments using the following syntax:
85 /// All selection ranges in one group are expected to produce the same
97 /// grouped source ranges in the given file otherwise.
  /src/external/apache2/llvm/dist/clang/lib/Frontend/
DiagnosticRenderer.cpp 90 ArrayRef<CharSourceRange> Ranges,
99 emitDiagnosticMessage(Loc, PresumedLoc(), Level, Message, Ranges, D);
101 // Get the ranges into a local array we can hack on.
102 SmallVector<CharSourceRange, 20> MutableRanges(Ranges.begin(),
103 Ranges.end());
127 emitDiagnosticMessage(Loc, PLoc, Level, Message, Ranges, D);
346 // Helper function to fix up source ranges. It takes in an array of ranges,
347 // and outputs an array of ranges where we want to draw the range highlighting
357 mapDiagnosticRanges(FullSourceLoc CaretLoc, ArrayRef<CharSourceRange> Ranges,
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/
ubsan_diag.cc 226 /// Find the earliest-starting range in Ranges which ends after Loc.
227 static Range *upperBound(MemoryLocation Loc, Range *Ranges,
231 if (Ranges[I].getEnd().getMemoryLocation() > Loc &&
234 Ranges[I].getStart().getMemoryLocation()))
235 Best = &Ranges[I];
250 Range *Ranges, unsigned NumRanges,
258 Min = __sanitizer::Min(Ranges[I].getStart().getMemoryLocation(), Min);
259 Max = __sanitizer::Max(Ranges[I].getEnd().getMemoryLocation(), Max);
283 Range *InRange = upperBound(Min, Ranges, NumRanges);
287 InRange = upperBound(P, Ranges, NumRanges)
    [all...]
  /src/external/gpl3/gcc/dist/libsanitizer/ubsan/
ubsan_diag.cpp 239 /// Find the earliest-starting range in Ranges which ends after Loc.
240 static Range *upperBound(MemoryLocation Loc, Range *Ranges,
244 if (Ranges[I].getEnd().getMemoryLocation() > Loc &&
247 Ranges[I].getStart().getMemoryLocation()))
248 Best = &Ranges[I];
263 Range *Ranges, unsigned NumRanges,
271 Min = __sanitizer::Min(Ranges[I].getStart().getMemoryLocation(), Min);
272 Max = __sanitizer::Max(Ranges[I].getEnd().getMemoryLocation(), Max);
296 Range *InRange = upperBound(Min, Ranges, NumRanges);
300 InRange = upperBound(P, Ranges, NumRanges)
    [all...]
  /src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/
ubsan_diag.cpp 233 /// Find the earliest-starting range in Ranges which ends after Loc.
234 static Range *upperBound(MemoryLocation Loc, Range *Ranges,
238 if (Ranges[I].getEnd().getMemoryLocation() > Loc &&
241 Ranges[I].getStart().getMemoryLocation()))
242 Best = &Ranges[I];
257 Range *Ranges, unsigned NumRanges,
265 Min = __sanitizer::Min(Ranges[I].getStart().getMemoryLocation(), Min);
266 Max = __sanitizer::Max(Ranges[I].getEnd().getMemoryLocation(), Max);
290 Range *InRange = upperBound(Min, Ranges, NumRanges);
294 InRange = upperBound(P, Ranges, NumRanges)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
TextDiagnostics.cpp 71 ArrayRef<SourceRange> Ranges,
74 DiagEng.Report(Loc, ID) << String << Ranges << Fixits;
78 DiagEng.Report(Loc, ID) << String << Ranges;
  /src/external/apache2/llvm/dist/llvm/lib/Support/
SourceMgr.cpp 263 const Twine &Msg, ArrayRef<SMRange> Ranges,
293 // Convert any ranges to column ranges that only intersect the line of the
295 for (unsigned i = 0, e = Ranges.size(); i != e; ++i) {
296 SMRange R = Ranges[i];
310 // Translate from SMLoc ranges to column ranges.
343 ArrayRef<SMRange> Ranges, ArrayRef<SMFixIt> FixIts,
345 PrintMessage(OS, GetMessage(Loc, Kind, Msg, Ranges, FixIts), ShowColors);
349 const Twine &Msg, ArrayRef<SMRange> Ranges,
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Core/
Diagnostic.h 61 /// Extra source ranges associated with the note, in addition to the location
63 llvm::SmallVector<FileByteRange, 1> Ranges;

Completed in 37 milliseconds

1 2 3 4 5 6 7 8 9