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

1 2 3 4 5 6

  /external/llvm/include/llvm/Support/
UnicodeCharRanges.h 1 //===--- UnicodeCharRanges.h - Types and functions for character ranges ---===//
49 /// Array pointed by \p Ranges should have the lifetime at least as long as
52 /// instances per each array of ranges, as possible.
59 LLVM_CONSTEXPR UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {}
61 UnicodeCharSet(CharRanges Ranges) : Ranges(Ranges) {
69 return std::binary_search(Ranges.begin(), Ranges.end(), C)
    [all...]
SourceMgr.h 163 ArrayRef<SMRange> Ranges = None,
169 ArrayRef<SMRange> Ranges = None,
186 ArrayRef<SMRange> Ranges = None,
240 std::vector<std::pair<unsigned, unsigned> > Ranges;
256 ArrayRef<std::pair<unsigned,unsigned> > Ranges,
268 return Ranges;
  /external/llvm/lib/MC/MCParser/
MCAsmParser.cpp 36 bool MCAsmParser::TokError(const Twine &Msg, ArrayRef<SMRange> Ranges) {
37 Error(getLexer().getLoc(), Msg, Ranges);
  /external/clang/include/clang/Frontend/
TextDiagnostic.h 81 ArrayRef<CharSourceRange> Ranges,
87 ArrayRef<CharSourceRange> Ranges,
92 SmallVectorImpl<CharSourceRange>& Ranges,
95 emitSnippetAndCaret(Loc, Level, Ranges, Hints, SM);
111 SmallVectorImpl<CharSourceRange>& Ranges,
DiagnosticRenderer.h 78 ArrayRef<CharSourceRange> Ranges,
84 ArrayRef<CharSourceRange> Ranges,
89 SmallVectorImpl<CharSourceRange>& Ranges,
118 ArrayRef<CharSourceRange> Ranges, ArrayRef<FixItHint> Hints,
122 ArrayRef<CharSourceRange> Ranges,
126 ArrayRef<CharSourceRange> Ranges,
140 /// \param Ranges The underlined ranges for this code snippet.
145 StringRef Message, ArrayRef<CharSourceRange> Ranges,
  /external/llvm/lib/CodeGen/AsmPrinter/
DbgValueHistoryCalculator.cpp 41 auto &Ranges = VarInstrRanges[Var];
42 if (!Ranges.empty() && Ranges.back().second == nullptr &&
43 Ranges.back().first->isIdenticalTo(&MI)) {
45 << "\t" << Ranges.back().first << "\t" << MI << "\n");
48 Ranges.push_back(std::make_pair(&MI, nullptr));
53 auto &Ranges = VarInstrRanges[Var];
55 assert(!Ranges.empty() && Ranges.back().second == nullptr);
56 // For now, instruction ranges are not allowed to cross basic bloc
    [all...]
DwarfUnit.h 54 // List of ranges.
55 SmallVector<RangeSpan, 2> Ranges;
58 RangeSpanList(MCSymbol *Sym, SmallVector<RangeSpan, 2> Ranges)
59 : RangeSym(Sym), Ranges(std::move(Ranges)) {}
61 const SmallVectorImpl<RangeSpan> &getRanges() const { return Ranges; }
62 void addRange(RangeSpan Range) { Ranges.push_back(Range); }
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
StringRange.java 89 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
91 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
93 Ranges item = new Ranges(s);
97 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
98 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
99 for (Ranges ranges : compacted) {
100 adder.add(ranges.start(), ranges.end(shorterPairs))
117 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
164 private final Range[] ranges; field in class:StringRange.Ranges
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
StringRange.java 85 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
87 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
89 Ranges item = new Ranges(s);
93 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
94 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
95 for (Ranges ranges : compacted) {
96 adder.add(ranges.start(), ranges.end(shorterPairs))
113 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
160 private final Range[] ranges; field in class:StringRange.Ranges
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
DereferenceChecker.cpp 46 SmallVectorImpl<SourceRange> &Ranges,
55 SmallVectorImpl<SourceRange> &Ranges,
69 Ranges.push_back(DR->getSourceRange());
78 Ranges.push_back(SourceRange(L, L));
86 Ranges.push_back(SourceRange(L, L));
107 SmallVector<SourceRange, 2> Ranges;
126 AddDerefSource(os, Ranges, AE->getBase()->IgnoreParenCasts(),
134 AddDerefSource(os, Ranges, AE->getBase()->IgnoreParenCasts(),
142 AddDerefSource(os, Ranges, U->getSubExpr()->IgnoreParens(),
151 AddDerefSource(os, Ranges, M->getBase()->IgnoreParenCasts()
    [all...]
MallocSizeofChecker.cpp 231 SmallVector<SourceRange, 4> Ranges;
232 Ranges.push_back(i->AllocCall->getCallee()->getSourceRange());
233 Ranges.push_back(SFinder.Sizeofs[0]->getSourceRange());
235 Ranges.push_back(TSI->getTypeLoc().getSourceRange());
242 categories::UnixAPI, OS.str(), L, Ranges);
  /external/libchrome/base/metrics/
bucket_ranges.h 5 // BucketRanges stores the vector of ranges that delimit what samples are
7 // same ranges for all their corresponding buckets should share the same
11 // value will need a BucketRanges with 6 ranges:
35 typedef std::vector<HistogramBase::Sample> Ranges;
46 // A bucket is defined by a consecutive pair of entries in |ranges|, so there
47 // is one fewer bucket than there are ranges. For example, if |ranges| is
52 // Checksum methods to verify whether the ranges are corrupted (e.g. bad
65 Ranges ranges_;
  /external/libchrome/sandbox/linux/bpf_dsl/
policy_compiler.h 76 typedef std::vector<Range> Ranges;
109 // Finds all the ranges of system calls that need to be handled. Ranges are
111 // ranges. System calls with identical CodeGen::Nodes are coalesced into a
114 void FindRanges(Ranges* ranges);
118 CodeGen::Node AssembleJumpTable(Ranges::const_iterator start,
119 Ranges::const_iterator stop);
  /external/clang/unittests/Format/
SortIncludesTest.cpp 24 std::vector<tooling::Range> Ranges(1, tooling::Range(0, Code.size()));
26 applyAllReplacements(Code, sortIncludes(Style, Code, Ranges, FileName));
28 reformat(Style, Sorted, Ranges, FileName));
32 std::vector<tooling::Range> Ranges(1, tooling::Range(0, Code.size()));
33 sortIncludes(Style, Code, Ranges, "input.cpp", &Cursor);
FormatTestProto.cpp 26 std::vector<tooling::Range> Ranges(1, tooling::Range(Offset, Length));
27 tooling::Replacements Replaces = reformat(Style, Code, Ranges);
FormatTestSelective.cpp 26 std::vector<tooling::Range> Ranges(1, tooling::Range(Offset, Length));
29 reformat(Style, Code, Ranges, "<stdin>", &IncompleteFormat);
  /external/llvm/unittests/Support/
SourceMgrTest.cpp 41 const Twine &Msg, ArrayRef<SMRange> Ranges,
44 SM.PrintMessage(OS, Loc, Kind, Msg, Ranges, FixIts);
132 SMRange Ranges[] = { getRange(0, 3), getRange(4, 3) };
133 printMessage(getLoc(4), SourceMgr::DK_Error, "message", Ranges, None);
143 SMRange Ranges[] = { getRange(0, 3), getRange(2, 4) };
144 printMessage(getLoc(4), SourceMgr::DK_Error, "message", Ranges, None);
  /external/llvm/include/llvm/MC/MCParser/
MCAsmParser.h 126 ArrayRef<SMRange> Ranges = None) = 0;
132 ArrayRef<SMRange> Ranges = None) = 0;
139 ArrayRef<SMRange> Ranges = None) = 0;
149 bool TokError(const Twine &Msg, ArrayRef<SMRange> Ranges = None);
  /external/clang/lib/Frontend/
DiagnosticRenderer.cpp 126 ArrayRef<CharSourceRange> Ranges,
136 emitDiagnosticMessage(Loc, PresumedLoc(), Level, Message, Ranges, SM, D);
138 // Get the ranges into a local array we can hack on.
139 SmallVector<CharSourceRange, 20> MutableRanges(Ranges.begin(),
140 Ranges.end());
166 emitDiagnosticMessage(Loc, PLoc, Level, Message, Ranges, SM, D);
384 // Helper function to fix up source ranges. It takes in an array of ranges,
385 // and outputs an array of ranges where we want to draw the range highlighting
396 ArrayRef<CharSourceRange> Ranges,
    [all...]
  /external/llvm/lib/Support/
SourceMgr.cpp 137 ArrayRef<SMRange> Ranges,
168 // 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.
217 const Twine &Msg, ArrayRef<SMRange> Ranges,
219 PrintMessage(OS, GetMessage(Loc, Kind, Msg, Ranges, FixIts), ShowColors);
223 const Twine &Msg, ArrayRef<SMRange> Ranges,
    [all...]
  /external/compiler-rt/lib/ubsan/
ubsan_diag.cc 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);
289 Range *InRange = upperBound(Min, Ranges, NumRanges);
293 InRange = upperBound(P, Ranges, NumRanges)
    [all...]
  /external/clang/tools/clang-format/
ClangFormat.cpp 41 "Multiple ranges can be formatted by specifying\n"
48 "Multiple ranges can be formatted by specifying\n"
58 "Multiple ranges can be formatted by specifying\n"
131 std::vector<tooling::Range> &Ranges) {
163 Ranges.push_back(tooling::Range(Offset, Length));
196 Ranges.push_back(tooling::Range(Offset, Length));
250 std::vector<tooling::Range> Ranges;
251 if (fillRanges(Code.get(), Ranges))
258 Replacements Replaces = sortIncludes(FormatStyle, Code->getBuffer(), Ranges,
263 Ranges.push_back({R.getOffset(), R.getLength()})
    [all...]
  /external/llvm/include/llvm/CodeGen/
LexicalScopes.h 65 SmallVectorImpl<InsnRange> &getRanges() { return Ranges; }
93 Ranges.push_back(InsnRange(FirstInsn, LastInsn));
128 SmallVector<InsnRange, 4> Ranges;
219 /// extractLexicalScopes - Extract instruction ranges for each lexical scopes
MachineMemOperand.h 99 const MDNode *Ranges;
126 const MDNode *Ranges = nullptr);
173 const MDNode *getRanges() const { return Ranges; }
  /external/clang/tools/libclang/
CXLoadedDiagnostic.h 49 /// \brief Return the number of source ranges for the diagnostic.
52 /// \brief Return the source ranges for the diagnostic.
84 std::vector<CXSourceRange> Ranges;

Completed in 873 milliseconds

1 2 3 4 5 6