| /external/llvm/lib/CodeGen/ |
| LiveInterval.cpp | 41 size_t Len = ranges.size();
58 ranges.push_back(LiveRange(Def, Def.getDeadSlot(), VNI));
76 ranges.insert(I, LiveRange(Def, Def.getDeadSlot(), VNI));
111 if (i != ranges.begin()) --i;
117 if (j != other.ranges.begin()) --j;
220 /// merge and eliminate all ranges that this will overlap with. The iterator is
222 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, SlotIndex NewEnd) {
223 assert(I != ranges.end() && "Not a valid interval!");
227 Ranges::iterator MergeTo = llvm::next(I);
228 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo)
[all...] |
| /external/chromium_org/ash/wm/workspace/ |
| magnetism_matcher.cc | 72 Ranges::const_iterator i =
91 Ranges::const_iterator it =
|
| /external/clang/lib/Frontend/ |
| TextDiagnostic.cpp | 684 ArrayRef<clang::CharSourceRange> Ranges,
691 emitDiagnosticLoc(Loc, PLoc, Level, Ranges, *SM);
769 /// ranges necessary.
772 ArrayRef<CharSourceRange> Ranges,
819 if (DiagOpts->ShowSourceRanges && !Ranges.empty()) {
824 for (ArrayRef<CharSourceRange>::const_iterator RI = Ranges.begin(),
825 RE = Ranges.end();
827 // Ignore invalid ranges.
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugAranges.cpp | 37 AddArangeDescriptors(DWARFDebugAranges::RangeColl &Ranges,
39 : RangeCollection(Ranges),
142 // Most address ranges are contiguous from function to function
143 // so our new ranges will likely be smaller. We calculate the size
144 // of the new ranges since although std::vector objects can be resized,
|
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 82 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);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| HTMLDiagnostics.cpp | 473 // Now highlight the ranges.
474 ArrayRef<SourceRange> Ranges = P.getRanges();
475 for (ArrayRef<SourceRange>::iterator I = Ranges.begin(),
476 E = Ranges.end(); I != E; ++I) {
|
| PathDiagnostic.cpp | 232 // Check the source ranges.
233 ArrayRef<SourceRange> Ranges = piece->getRanges();
234 for (ArrayRef<SourceRange>::iterator I = Ranges.begin(),
235 E = Ranges.end(); I != E; ++I) {
[all...] |
| /external/clang/tools/libclang/ |
| CIndexDiagnostic.cpp | 116 ArrayRef<CharSourceRange> Ranges,
133 ArrayRef<CharSourceRange> Ranges,
138 SmallVectorImpl<CharSourceRange>& Ranges,
250 // and source ranges.
|
| CXLoadedDiagnostic.cpp | 120 return Ranges.size();
124 assert(Range < Ranges.size());
125 return Ranges[Range];
616 D->Ranges.push_back(SR);
|
| /external/chromium_org/media/filters/ |
| source_buffer_stream.h | 5 // SourceBufferStream is a data structure that stores media Buffers in ranges.
23 #include "media/base/ranges.h"
99 // Returns a list of the buffered time ranges.
100 Ranges<base::TimeDelta> GetBufferedTime() const;
152 // Resolve overlapping ranges such that no ranges overlap anymore.
274 // Returns true if we don't have any ranges or the last range is selected
275 // or there is a pending seek beyond any existing ranges.
282 // List of disjoint buffered ranges, ordered by start time.
|
| /external/clang/include/clang/Basic/ |
| Diagnostic.h | 716 /// \brief The maximum number of ranges we can hold.
719 /// \brief The maximum number of ranges we can hold.
725 /// \brief The number of ranges in the DiagRanges array.
750 /// \brief The list of ranges added to this diagnostic.
841 /// allows insertion of extra information (arguments and source ranges) into
[all...] |
| /external/clang/lib/Basic/ |
| Diagnostic.cpp | 599 /// | '[' number ',' number ']' -> ranges are inclusive both ends
[all...] |
| /external/clang/lib/Format/ |
| Format.cpp | [all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| sandbox_bpf.cc | 556 // ranges of identical codes.
557 Ranges ranges; local
558 FindRanges(&ranges);
560 // Compile the system call ranges to an optimized BPF jumptable
562 AssembleJumpTable(gen, ranges.begin(), ranges.end());
707 void Sandbox::FindRanges(Ranges *ranges) {
730 ranges->push_back(Range(old_sysnum, sysnum - 1, old_err))
[all...] |
| /external/clang/lib/StaticAnalyzer/Frontend/ |
| AnalysisConsumer.cpp | 107 // Get the ranges from the last point in the path.
108 ArrayRef<SourceRange> Ranges = PD->path.back()->getRanges();
110 for (ArrayRef<SourceRange>::iterator I = Ranges.begin(),
111 E = Ranges.end(); I != E; ++I) {
|
| /external/llvm/include/llvm/Support/ |
| IntegersSubsetMapping.h | 142 if (Pt > OpenPt/*Don't add empty ranges.*/ && RightMapping)
161 "Subset is not sorted or contains overlapped ranges");
200 "Subset is not sorted or contains overlapped ranges");
364 /// Adds all ranges and values from given ranges set to the current
521 //switches with case ranges, and if these passes meet switch
540 /// all ranges belongs to the same successor.
542 RangesCollection Ranges;
544 Ranges.push_back(i->first);
545 return IntegersSubsetTy(Ranges);
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | 442 const SmallVectorImpl<InsnRange> &Ranges = Scope->getRanges();
443 if (Ranges.empty())
446 // If we have multiple ranges, emit them into the range section.
447 if (Ranges.size() > 1) {
454 for (SmallVectorImpl<InsnRange>::const_iterator RI = Ranges.begin(),
455 RE = Ranges.end(); RI != RE; ++RI) {
467 SmallVectorImpl<InsnRange>::const_iterator RI = Ranges.begin();
486 const SmallVectorImpl<InsnRange> &Ranges = Scope->getRanges();
487 assert(Ranges.empty() == false &&
504 if (Ranges.size() > 1)
[all...] |
| /external/chromium_org/content/renderer/media/android/ |
| media_source_delegate.h | 18 #include "media/base/ranges.h"
220 media::Ranges<base::TimeDelta> buffered_time_ranges_;
221 // Keep a list of buffered time ranges.
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| malloc_extension.cc | 339 void MallocExtension::Ranges(void* arg, RangeFunction func) {
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| malloc_extension.cc | 334 void MallocExtension::Ranges(void* arg, RangeFunction func) {
|
| /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");
|
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/imageinfo/imageinfo/ |
| binaryajax.js | 206 var strAcceptRanges = oHTTP.getResponseHeader("Accept-Ranges");
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 406 const MDNode *Ranges = 0);
|
| /external/llvm/lib/Support/ |
| YAMLParser.cpp | 263 ArrayRef<SMRange> Ranges = None) {
264 SM.PrintMessage(Loc, Kind, Message, Ranges);
[all...] |
