AddressRanges.cpp 1.8 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
  1. //===- AddressRanges.cpp ----------------------------------------*- C++ -*-===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. #include "llvm/ADT/AddressRanges.h"
  9. #include "llvm/ADT/STLExtras.h"
  10. #include <inttypes.h>
  11. using namespace llvm;
  12. AddressRanges::Collection::const_iterator
  13. AddressRanges::insert(AddressRange Range) {
  14. if (Range.size() == 0)
  15. return Ranges.end();
  16. auto It = llvm::upper_bound(Ranges, Range);
  17. auto It2 = It;
  18. while (It2 != Ranges.end() && It2->start() <= Range.end())
  19. ++It2;
  20. if (It != It2) {
  21. Range = {Range.start(), std::max(Range.end(), std::prev(It2)->end())};
  22. It = Ranges.erase(It, It2);
  23. }
  24. if (It != Ranges.begin() && Range.start() <= std::prev(It)->end()) {
  25. --It;
  26. *It = {It->start(), std::max(It->end(), Range.end())};
  27. return It;
  28. }
  29. return Ranges.insert(It, Range);
  30. }
  31. AddressRanges::Collection::const_iterator
  32. AddressRanges::find(uint64_t Addr) const {
  33. auto It = std::partition_point(
  34. Ranges.begin(), Ranges.end(),
  35. [=](const AddressRange &R) { return R.start() <= Addr; });
  36. if (It == Ranges.begin())
  37. return Ranges.end();
  38. --It;
  39. if (Addr >= It->end())
  40. return Ranges.end();
  41. return It;
  42. }
  43. AddressRanges::Collection::const_iterator
  44. AddressRanges::find(AddressRange Range) const {
  45. if (Range.size() == 0)
  46. return Ranges.end();
  47. auto It = std::partition_point(
  48. Ranges.begin(), Ranges.end(),
  49. [=](const AddressRange &R) { return R.start() <= Range.start(); });
  50. if (It == Ranges.begin())
  51. return Ranges.end();
  52. --It;
  53. if (Range.end() > It->end())
  54. return Ranges.end();
  55. return It;
  56. }