LexicalBlock.hpp

Go to the documentation of this file.

/* Copyright 2022 - 2025 R. Thomas
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
#ifndef LIEF_DWARF_LEXICAL_BLOCK_H
#define LIEF_DWARF_LEXICAL_BLOCK_H
 
#include "LIEF/visibility.h"
#include "LIEF/iterators.hpp"
#include "LIEF/optional.hpp"
#include "LIEF/range.hpp"
 
#include <memory>
#include <string>
#include <cstdint>
 
namespace LIEF {
namespace dwarf {
 
namespace details {
class LexicalBlock;
class LexicalBlockIt;
}

class LIEF_API LexicalBlock {
  public:
  class LIEF_API Iterator {
    public:
    using iterator_category = std::bidirectional_iterator_tag;
    using value_type = std::unique_ptr<LexicalBlock>;
    using difference_type = std::ptrdiff_t;
    using pointer = LexicalBlock*;
    using reference = std::unique_ptr<LexicalBlock>&;
    using implementation = details::LexicalBlockIt;
 
    class LIEF_API PointerProxy {
      // Inspired from LLVM's iterator_facade_base
      friend class Iterator;
      public:
      pointer operator->() const { return R.get(); }
 
      private:
      value_type R;
 
      template <typename RefT>
      PointerProxy(RefT &&R) : R(std::forward<RefT>(R)) {} // NOLINT(bugprone-forwarding-reference-overload)
    };
 
    Iterator(const Iterator&);
    Iterator(Iterator&&) noexcept;
    Iterator(std::unique_ptr<details::LexicalBlockIt> impl);
    ~Iterator();
 
    friend LIEF_API bool operator==(const Iterator& LHS, const Iterator& RHS);
    friend LIEF_API bool operator!=(const Iterator& LHS, const Iterator& RHS) {
      return !(LHS == RHS);
    }
 
    Iterator& operator++();
    Iterator& operator--();
 
    Iterator operator--(int) {
      Iterator tmp = *static_cast<Iterator*>(this);
      --*static_cast<Iterator *>(this);
      return tmp;
    }
 
    Iterator operator++(int) {
      Iterator tmp = *static_cast<Iterator*>(this);
      ++*static_cast<Iterator *>(this);
      return tmp;
    }
 
    std::unique_ptr<LexicalBlock> operator*() const;
 
    PointerProxy operator->() const {
      return static_cast<const Iterator*>(this)->operator*();
    }
 
    private:
    std::unique_ptr<details::LexicalBlockIt> impl_;
  };
 
  using sub_blocks_it = iterator_range<Iterator>;
 
  LexicalBlock(std::unique_ptr<details::LexicalBlock> impl);
  LexicalBlock() = delete;
  LexicalBlock& operator=(const LexicalBlock&) = delete;
  LexicalBlock(const LexicalBlock&) = delete;

  std::string name() const;

  std::string description() const;

  sub_blocks_it sub_blocks() const;

  optional<uint64_t> addr() const;

  uint64_t size() const;

  optional<uint64_t> low_pc() const;

  optional<uint64_t> high_pc() const;

  std::vector<range_t> ranges() const;
 
  ~LexicalBlock();
 
  LIEF_LOCAL static
    std::unique_ptr<LexicalBlock> create(std::unique_ptr<details::LexicalBlock> impl);
 
  protected:
  std::unique_ptr<details::LexicalBlock> impl_;
};
 
}
}
#endif