dd0973be58
Split MatchDataInfo, CXXPredicates and the Pattern hierarchy into their own files. This should help with maintenance a bit, and make the API easier to navigate. I hope this encourages a bit more experimentation with MIR patterns, e.g. I'd like to try getting them in ISel at some point. Currently, this is pretty much only moving code around. There is no significant refactoring in there. I want to split the Combiner backend even more at some point though, e.g. by separating the TableGen parsing logic into yet another file so other backends could very easily parse patterns themselves. Note: I moved the responsibility of managing string lifetimes into the backend instead of the Pattern class. e.g. Before you'd do `P.addOperand(Name)` but now it's `P.addOperand(insertStrRef(Name))`. I verified this was done correctly by running the tests with UBSan/ASan.
87 lines
2.7 KiB
C++
87 lines
2.7 KiB
C++
//===- CXXPredicates.h ------------------------------------------*- C++ -*-===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
/// \file Contains utilities related to handling C++ code in MIR patterns for
|
|
/// GlobalISel. C++ predicates need to be expanded, and then stored in a
|
|
/// static pool until they can be emitted.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_UTILS_MIRPATTERNS_CXXPREDICATES_H
|
|
#define LLVM_UTILS_MIRPATTERNS_CXXPREDICATES_H
|
|
|
|
#include "llvm/ADT/DenseMap.h"
|
|
#include "llvm/ADT/Hashing.h"
|
|
#include "llvm/ADT/StringRef.h"
|
|
#include <memory>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
namespace llvm {
|
|
namespace gi {
|
|
|
|
/// Entry into the static pool of all CXX Predicate code. This contains
|
|
/// fully expanded C++ code.
|
|
///
|
|
/// The static pool is hidden inside the object and can be accessed through
|
|
/// getAllMatchCode/getAllApplyCode
|
|
///
|
|
/// Note that CXXPattern trims C++ code, so the Code is already expected to be
|
|
/// free of leading/trailing whitespace.
|
|
class CXXPredicateCode {
|
|
using CXXPredicateCodePool =
|
|
DenseMap<hash_code, std::unique_ptr<CXXPredicateCode>>;
|
|
static CXXPredicateCodePool AllCXXMatchCode;
|
|
static CXXPredicateCodePool AllCXXApplyCode;
|
|
|
|
/// Sorts a `CXXPredicateCodePool` by their IDs and returns it.
|
|
static std::vector<const CXXPredicateCode *>
|
|
getSorted(const CXXPredicateCodePool &Pool);
|
|
|
|
/// Gets an instance of `CXXPredicateCode` for \p Code, or returns an already
|
|
/// existing one.
|
|
static const CXXPredicateCode &get(CXXPredicateCodePool &Pool,
|
|
std::string Code);
|
|
|
|
CXXPredicateCode(std::string Code, unsigned ID);
|
|
|
|
public:
|
|
static const CXXPredicateCode &getMatchCode(std::string Code) {
|
|
return get(AllCXXMatchCode, std::move(Code));
|
|
}
|
|
|
|
static const CXXPredicateCode &getApplyCode(std::string Code) {
|
|
return get(AllCXXApplyCode, std::move(Code));
|
|
}
|
|
|
|
static std::vector<const CXXPredicateCode *> getAllMatchCode() {
|
|
return getSorted(AllCXXMatchCode);
|
|
}
|
|
|
|
static std::vector<const CXXPredicateCode *> getAllApplyCode() {
|
|
return getSorted(AllCXXApplyCode);
|
|
}
|
|
|
|
const std::string Code;
|
|
const unsigned ID;
|
|
const std::string BaseEnumName;
|
|
|
|
bool needsUnreachable() const {
|
|
return !StringRef(Code).starts_with("return");
|
|
}
|
|
|
|
std::string getEnumNameWithPrefix(StringRef Prefix) const {
|
|
return Prefix.str() + BaseEnumName;
|
|
}
|
|
};
|
|
|
|
} // namespace gi
|
|
} // end namespace llvm
|
|
|
|
#endif // ifndef LLVM_UTILS_MIRPATTERNS_CXXPREDICATES_H
|