CIRTypesDetails.h

Go to the documentation of this file.

//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file contains implementation details, such as storage structures, of
// CIR dialect types.
//
//===----------------------------------------------------------------------===//
#ifndef CIR_DIALECT_IR_CIRTYPESDETAILS_H
#define CIR_DIALECT_IR_CIRTYPESDETAILS_H
 
#include "mlir/IR/BuiltinAttributes.h"
#include "mlir/Support/LogicalResult.h"
#include "clang/CIR/Dialect/IR/CIRTypes.h"
#include "llvm/ADT/Hashing.h"
 
namespace cir {
namespace detail {
 
//===----------------------------------------------------------------------===//
// CIR StructTypeStorage
//===----------------------------------------------------------------------===//
 
/// Type storage for CIR struct/class types.
struct StructTypeStorage : public mlir::TypeStorage {
  struct KeyTy {
    llvm::ArrayRef<mlir::Type> members;
    mlir::StringAttr name;
    bool incomplete;
    bool packed;
    llvm::ArrayRef<RecordMemberKind> member_kinds;
    bool is_class;
 
    KeyTy(llvm::ArrayRef<mlir::Type> members, mlir::StringAttr name,
          bool incomplete, bool packed,
          llvm::ArrayRef<RecordMemberKind> member_kinds, bool is_class)
        : members(members), name(name), incomplete(incomplete), packed(packed),
          member_kinds(member_kinds), is_class(is_class) {}
  };
 
  llvm::ArrayRef<mlir::Type> members;
  mlir::StringAttr name;
  bool incomplete;
  bool packed;
  llvm::ArrayRef<RecordMemberKind> member_kinds;
  bool is_class;
 
  StructTypeStorage(llvm::ArrayRef<mlir::Type> members, mlir::StringAttr name,
                    bool incomplete, bool packed,
                    llvm::ArrayRef<RecordMemberKind> member_kinds,
                    bool is_class)
      : members(members), name(name), incomplete(incomplete), packed(packed),
        member_kinds(member_kinds), is_class(is_class) {
    assert((name || !incomplete) && "Incomplete records must have a name");
    assert(member_kinds.size() == members.size() &&
           "every member must say what it holds");
  }
 
  KeyTy getAsKey() const {
    return KeyTy(members, name, incomplete, packed, member_kinds, is_class);
  }
 
  bool operator==(const KeyTy &key) const {
    if (name)
      return (name == key.name) && (is_class == key.is_class);
    return std::tie(members, name, incomplete, packed, member_kinds,
                    is_class) == std::tie(key.members, key.name, key.incomplete,
                                          key.packed, key.member_kinds,
                                          key.is_class);
  }
 
  static llvm::hash_code hashKey(const KeyTy &key) {
    if (key.name)
      return llvm::hash_combine(key.name, key.is_class);
    return llvm::hash_combine(key.members, key.incomplete, key.packed,
                              key.member_kinds, key.is_class);
  }
 
  static StructTypeStorage *construct(mlir::TypeStorageAllocator &allocator,
                                      const KeyTy &key) {
    return new (allocator.allocate<StructTypeStorage>()) StructTypeStorage(
        allocator.copyInto(key.members), key.name, key.incomplete, key.packed,
        allocator.copyInto(key.member_kinds), key.is_class);
  }
 
  /// Mutates the members and attributes of an identified struct/class.
  llvm::LogicalResult mutate(mlir::TypeStorageAllocator &allocator,
                             llvm::ArrayRef<mlir::Type> members, bool packed,
                             llvm::ArrayRef<RecordMemberKind> memberKinds) {
    if (!name)
      return llvm::failure();
 
    // A second completion must agree with the first in every parameter,
    // including the kinds: otherwise it silently keeps the kinds it was given
    // the first time.
    if (!incomplete)
      return mlir::success((this->members == members) &&
                           (this->packed == packed) &&
                           (this->member_kinds == memberKinds));
 
    // mutate is the one entrance verify() never sees, so check the length here
    // rather than leave it to an assert.
    if (memberKinds.size() != members.size())
      return llvm::failure();
 
    this->members = allocator.copyInto(members);
    this->packed = packed;
    this->member_kinds = allocator.copyInto(memberKinds);
    incomplete = false;
    return llvm::success();
  }
};
 
//===----------------------------------------------------------------------===//
// CIR UnionTypeStorage
//===----------------------------------------------------------------------===//
 
/// Type storage for CIR union types.
struct UnionTypeStorage : public mlir::TypeStorage {
  struct KeyTy {
    llvm::ArrayRef<mlir::Type> members;
    mlir::StringAttr name;
    bool incomplete;
    bool packed;
    mlir::Type padding;
    llvm::ArrayRef<RecordMemberKind> member_kinds;
 
    KeyTy(llvm::ArrayRef<mlir::Type> members, mlir::StringAttr name,
          bool incomplete, bool packed, mlir::Type padding,
          llvm::ArrayRef<RecordMemberKind> member_kinds)
        : members(members), name(name), incomplete(incomplete), packed(packed),
          padding(padding), member_kinds(member_kinds) {}
  };
 
  llvm::ArrayRef<mlir::Type> members;
  mlir::StringAttr name;
  bool incomplete;
  bool packed;
  mlir::Type padding;
  llvm::ArrayRef<RecordMemberKind> member_kinds;
 
  UnionTypeStorage(llvm::ArrayRef<mlir::Type> members, mlir::StringAttr name,
                   bool incomplete, bool packed, mlir::Type padding,
                   llvm::ArrayRef<RecordMemberKind> member_kinds)
      : members(members), name(name), incomplete(incomplete), packed(packed),
        padding(padding), member_kinds(member_kinds) {
    assert((name || !incomplete) && "Incomplete records must have a name");
    assert(member_kinds.size() == members.size() &&
           "every member must say what it holds");
  }
 
  KeyTy getAsKey() const {
    return KeyTy(members, name, incomplete, packed, padding, member_kinds);
  }
 
  bool operator==(const KeyTy &key) const {
    if (name)
      return name == key.name;
    return std::tie(members, name, incomplete, packed, padding, member_kinds) ==
           std::tie(key.members, key.name, key.incomplete, key.packed,
                    key.padding, key.member_kinds);
  }
 
  static llvm::hash_code hashKey(const KeyTy &key) {
    if (key.name)
      return llvm::hash_combine(key.name);
    return llvm::hash_combine(key.members, key.incomplete, key.packed,
                              key.padding, key.member_kinds);
  }
 
  static UnionTypeStorage *construct(mlir::TypeStorageAllocator &allocator,
                                     const KeyTy &key) {
    return new (allocator.allocate<UnionTypeStorage>()) UnionTypeStorage(
        allocator.copyInto(key.members), key.name, key.incomplete, key.packed,
        key.padding, allocator.copyInto(key.member_kinds));
  }
 
  /// Mutates the members and attributes of an identified union.
  llvm::LogicalResult mutate(mlir::TypeStorageAllocator &allocator,
                             llvm::ArrayRef<mlir::Type> members, bool packed,
                             mlir::Type padding,
                             llvm::ArrayRef<RecordMemberKind> memberKinds) {
    if (!name)
      return llvm::failure();
 
    // A second completion must agree with the first in every parameter,
    // including the kinds: otherwise it silently keeps the kinds it was given
    // the first time.
    if (!incomplete)
      return mlir::success(
          (this->members == members) && (this->packed == packed) &&
          (this->padding == padding) && (this->member_kinds == memberKinds));
 
    // mutate is the one entrance verify() never sees, so check the length here
    // rather than leave it to an assert.
    if (memberKinds.size() != members.size())
      return llvm::failure();
 
    this->members = allocator.copyInto(members);
    this->packed = packed;
    this->padding = padding;
    this->member_kinds = allocator.copyInto(memberKinds);
    incomplete = false;
    return llvm::success();
  }
};
 
} // namespace detail
} // namespace cir
 
#endif // CIR_DIALECT_IR_CIRTYPESDETAILS_H