File: BitPatternReader.h

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (82 lines) | stat: -rw-r--r-- 2,469 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
//===--- BitPatternReader.h - Split bit patterns into chunks. -------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2019 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//

#pragma once

#include "swift/Basic/ClusteredBitVector.h"

#include "llvm/ADT/APInt.h"
#include <optional>

namespace swift {
namespace irgen {

/// BitPatternReader allows an APInt to be read from in chunks.
/// Chunks may be read starting from either the least significant bit
/// (little-endian) or the most significant bit (big-endian).
///
/// This is useful when interpreting an APInt as a multi-byte mask
/// that needs to be applied to a value with a composite type.
///
/// Example:
///
///   // big-endian
///   auto x = BitPatternReader(APInt(32, 0x1234), false);
///   x.read(16) // 0x12
///   x.read(8)  // 0x3
///   x.read(8)  // 0x4
///
///   // little-endian
///   auto y = BitPatternReader(APInt(32, 0x1234), true);
///   y.read(16) // 0x34
///   y.read(8)  // 0x2
///   y.read(8)  // 0x1
///
class BitPatternReader {
  using APInt = llvm::APInt;

  const APInt Value;
  const bool LittleEndian;
  unsigned Offset = 0;
public:
  /// If the reader is in little-endian mode then bits will be read
  /// from the least significant to the most significant. Otherwise
  /// they will be read from the most significant to the least
  /// significant.
  BitPatternReader(const APInt &value, bool littleEndian) :
      Value(value),
      LittleEndian(littleEndian) {}

  /// Read the given number of bits from the unread part of the
  /// underlying value and adjust the remaining value as appropriate.
  APInt read(unsigned numBits) {
    assert(numBits % 8 == 0);
    assert(Value.getBitWidth() >= Offset + numBits);
    unsigned offset = Offset;
    if (!LittleEndian) {
      offset = Value.getBitWidth() - offset - numBits;
    }
    Offset += numBits;
    return Value.extractBits(numBits, offset);
  }

  // Skip the number of bits provided.
  void skip(unsigned numBits) {
    assert(numBits % 8 == 0);
    assert(Value.getBitWidth() >= Offset + numBits);
    Offset += numBits;
  }
};

} // end namespace irgen
} // end namespace swift