| /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/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/Target/PowerPC/ |
| PPCISelLowering.h | 684 const MDNode *Ranges;
686 ReuseLoadInfo() : IsInvariant(false), Alignment(0), Ranges(nullptr) {}
[all...] |
| /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/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;
|
| /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/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/clang/lib/StaticAnalyzer/Core/ |
| PlistDiagnostics.cpp | 105 // Make the ranges of the start and end point self-consistent with adjacent edges
160 // Output the ranges (if any).
161 ArrayRef<SourceRange> Ranges = P.getRanges();
163 if (!Ranges.empty()) {
164 Indent(o, indent) << "<key>ranges</key>\n";
167 for (auto &R : Ranges)
292 // ranges of the diagnostics.
316 ArrayRef<SourceRange> Ranges = piece->getRanges();
317 for (ArrayRef<SourceRange>::iterator I = Ranges.begin(),
318 E = Ranges.end(); I != E; ++I)
[all...] |
| HTMLDiagnostics.cpp | 552 // Now highlight the ranges.
553 ArrayRef<SourceRange> Ranges = P.getRanges();
554 for (ArrayRef<SourceRange>::iterator I = Ranges.begin(),
555 E = Ranges.end(); I != E; ++I) {
|
| RangeConstraintManager.cpp | 70 /// RangeSet contains a set of ranges. If the set is empty, then
75 PrimRangeSet ranges; // no need to make const, since it is an member in class:__anon6858::RangeSet
82 RangeSet(PrimRangeSet RS) : ranges(RS) {}
84 /// Create a new set with all ranges of this set and RS.
87 PrimRangeSet Ranges(RS.ranges);
88 for (const auto &range : ranges)
89 Ranges = F.add(Ranges, range);
90 return RangeSet(Ranges);
[all...] |
| BugReporterVisitors.cpp | 114 const auto &Ranges = BR.getRanges();
117 // special ranges for this report.
119 L, BR.getDescription(), Ranges.begin() == Ranges.end());
120 for (SourceRange Range : Ranges)
[all...] |
| /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/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/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.h | 179 /// The ranges which have been added to this diagnostic so far.
180 Range Ranges[MaxRanges];
191 Ranges[NumRanges++] = A;
|
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 83 SmallVector<SourceRange, 4> Ranges;
163 /// ranges are uniqued - only one of the equivalent reports will be presented
281 /// Ranges are used to highlight regions of interest in the source code.
285 /// ranges.
287 assert((R.isValid() || Ranges.empty()) && "Invalid range can only be used "
289 Ranges.push_back(R);
472 ArrayRef<SourceRange> Ranges = None);
477 ArrayRef<SourceRange> Ranges = None);
|
| /external/llvm/lib/Transforms/Scalar/ |
| MemCpyOptimizer.cpp | 138 /// two ranges into [0, 3) which is memset'able.
204 /// A sorted list of the memset ranges.
205 SmallVector<MemsetRange, 8> Ranges;
212 const_iterator begin() const { return Ranges.begin(); }
213 const_iterator end() const { return Ranges.end(); }
214 bool empty() const { return Ranges.empty(); }
245 /// existing ranges as appropriate.
250 range_iterator I = std::lower_bound(Ranges.begin(), Ranges.end(), Start,
256 if (I == Ranges.end() || End < I->Start)
[all...] |
| /external/clang/include/clang/Frontend/ |
| ASTUnit.h | 83 std::vector<std::pair<unsigned, unsigned> > Ranges;
[all...] |
| /external/clang/lib/Format/ |
| Format.cpp | [all...] |
