//===--- ASTConcept.cpp - Concepts Related AST Data Structures --*- C++ -*-===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// /// /// \file /// \brief This file defines AST data structures related to concepts. /// //===----------------------------------------------------------------------===// #include "clang/AST/ASTConcept.h" #include "clang/AST/ASTContext.h" using namespace clang; ASTConstraintSatisfaction::ASTConstraintSatisfaction(const ASTContext &C, const ConstraintSatisfaction &Satisfaction): NumRecords{Satisfaction.Details.size()}, IsSatisfied{Satisfaction.IsSatisfied} { for (unsigned I = 0; I < NumRecords; ++I) { auto &Detail = Satisfaction.Details[I]; if (Detail.second.is()) new (getTrailingObjects() + I) UnsatisfiedConstraintRecord{Detail.first, UnsatisfiedConstraintRecord::second_type( Detail.second.get())}; else { auto &SubstitutionDiagnostic = *Detail.second.get *>(); unsigned MessageSize = SubstitutionDiagnostic.second.size(); char *Mem = new (C) char[MessageSize]; memcpy(Mem, SubstitutionDiagnostic.second.data(), MessageSize); auto *NewSubstDiag = new (C) std::pair( SubstitutionDiagnostic.first, StringRef(Mem, MessageSize)); new (getTrailingObjects() + I) UnsatisfiedConstraintRecord{Detail.first, UnsatisfiedConstraintRecord::second_type( NewSubstDiag)}; } } } ASTConstraintSatisfaction * ASTConstraintSatisfaction::Create(const ASTContext &C, const ConstraintSatisfaction &Satisfaction) { std::size_t size = totalSizeToAlloc( Satisfaction.Details.size()); void *Mem = C.Allocate(size, alignof(ASTConstraintSatisfaction)); return new (Mem) ASTConstraintSatisfaction(C, Satisfaction); }