//===- GlobalizeObjectGraph.cpp ----------------------------------*- C++-*-===// // // This file is licensed 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 // //===----------------------------------------------------------------------===// #include "PassDetail.h" #include "mlir/Dialect/StandardOps/IR/Ops.h" #include "mlir/IR/BlockAndValueMapping.h" #include "mlir/IR/Builders.h" #include "mlir/IR/BuiltinOps.h" #include "npcomp/Dialect/Basicpy/IR/BasicpyDialect.h" #include "npcomp/Dialect/Torch/IR/TorchDialect.h" #include "npcomp/Dialect/Torch/IR/TorchOps.h" #include "npcomp/Dialect/Torch/Transforms/Passes.h" #include "llvm/ADT/MapVector.h" using namespace mlir; using namespace mlir::NPCOMP; using namespace mlir::NPCOMP::Torch; namespace { // See the pass documentation for `torch-globalize-object-graph`. class ObjectGraphGlobalizer { public: ObjectGraphGlobalizer(ModuleOp module); LogicalResult globalizeObjectGraph(); private: FailureOr findRootNnModule(); LogicalResult checkSingleInstanceOfEachClass(); LogicalResult recursivelyTraverseClassType(ClassTypeOp classType); void createInitializerFunc(); LogicalResult rewriteMethods(); void removeObjectGraph(); ModuleOp module; SymbolTable symbolTable; OpBuilder globalBuilder; // The stack of attribute names we have traversed during our recursive // traversal of the class/object hierarchy. // // Linkage names are calculated based on the set of attribute names traversed // from the root class/module in the program. SmallVector nameStack; // Sometimes it is natural to want a map keyed on torch.attr ops or torch.slot // ops. However, usually it is better to keep a map keyed on an ClassTypeOp // + attr name since frequently that is all one has access to and it // would be tedious to scan the body of the ClassTypeOp for the torch.attr // with the corresponding name. using AttrOfClass = std::pair; // The initial value associated with an attribute of a class. // Since we only allow a single instance of a class, this is equivalent to // the initial value of the unique slot corresponding to that attr. DenseMap slotInitialValues; // The inverse map of `slotInitialValues`. // Many attributes can have the same initial value, so the value type // is a vector. DenseMap> slotInitialValuesInverseMap; // The torch.global_slot corresponding to each torch.attr/torch.slot. DenseMap globalSlotForAttr; // The linkage name (value) for the function with symbol name (key). DenseMap methodLinkageNames; // The set of class types that have already been processed. // Used for diagnostics. // The map value is the original path from the root that we found it at. DenseMap seenClassTypes; }; } // namespace ObjectGraphGlobalizer::ObjectGraphGlobalizer(ModuleOp module) : module(module), symbolTable(module), globalBuilder(module.getBodyRegion()) {} LogicalResult ObjectGraphGlobalizer::globalizeObjectGraph() { // We require there to be a unique root !torch.nn.Module. FailureOr maybeRootNnModule = findRootNnModule(); if (failed(maybeRootNnModule)) return failure(); NnModuleOp rootNnModule = *maybeRootNnModule; if (!rootNnModule) return module.emitError() << "module does not contain a root torch.nn_module"; // We require one instance of each class. That is, there is a single // torch.nn_module for each torch.class_type. if (failed(checkSingleInstanceOfEachClass())) return failure(); for (NnModuleOp nnModule : module.getOps()) { auto classType = symbolTable.lookup(nnModule.getClassName()); for (auto slot : nnModule.getOps()) { AttrOfClass attrOfClass = {classType, slot.name()}; slotInitialValues[attrOfClass] = slot.value(); slotInitialValuesInverseMap[slot.value()].push_back(attrOfClass); } } // Recursively traverse the class hierarchy, globalizing slots and // tracking linkage names for methods. auto rootClassType = symbolTable.lookup(rootNnModule.getClassName()); if (failed(recursivelyTraverseClassType(rootClassType))) return failure(); // Move all slot initial values into an initializer func. createInitializerFunc(); // Rewrite torch.prim.GetAttr/torch.prim.SetAttr/torch.prim.CallMethod. if (failed(rewriteMethods())) return failure(); // Now that all we have finished converting to the new form, remove // the original object graph. removeObjectGraph(); return success(); } FailureOr ObjectGraphGlobalizer::findRootNnModule() { NnModuleOp rootNnModule; for (NnModuleOp op : module.getOps()) { if (!op.use_empty()) continue; if (rootNnModule) { op.emitError() .append("found more than one root module (module that is not a " "child of any other module)") .attachNote(rootNnModule.getLoc()) .append("see other root module here"); return failure(); } rootNnModule = op; } return rootNnModule; } LogicalResult ObjectGraphGlobalizer::checkSingleInstanceOfEachClass() { llvm::MapVector> classInstances; for (NnModuleOp op : module.getOps()) { auto classType = symbolTable.lookup(op.getClassName()); classInstances[classType].push_back(op); } for (auto &p : classInstances) { ClassTypeOp classType = cast(p.first); ArrayRef instances = p.second; if (instances.size() > 1) { // TODO: Improve this diagnostic based on user use cases. // This is a user-facing diagnostic that enforces key invariants to // our TorchScript subset. auto diag = classType.emitError( "class type has more than one instance: the current TorchScript " "supported subset only allows single instances"); for (NnModuleOp instance : instances) { diag.attachNote(instance.getLoc()) << "see instance here"; } return failure(); } } return success(); } LogicalResult ObjectGraphGlobalizer::recursivelyTraverseClassType(ClassTypeOp classType) { std::string pathToClassFromRoot = llvm::join(nameStack, "."); if (!seenClassTypes.insert({classType, pathToClassFromRoot}).second) { return classType.emitError() << "reachable by multiple paths from root object: '." << seenClassTypes[classType] << "' and '." << pathToClassFromRoot << "'"; } // For each attr, create a global slot for it. for (auto attr : classType.getOps()) { nameStack.push_back(attr.name().str()); if (auto type = attr.type().dyn_cast()) { recursivelyTraverseClassType( symbolTable.lookup(type.getClassName())); } else { auto linkageName = llvm::join(nameStack, "."); auto globalSlot = globalBuilder.create( attr->getLoc(), linkageName, TypeAttr::get(attr.type())); AttrOfClass attrOfClass = {classType, attr.name()}; assert(globalSlotForAttr.find(attrOfClass) == globalSlotForAttr.end()); globalSlotForAttr[attrOfClass] = globalSlot; } nameStack.pop_back(); } // For each method, track the linkage name it will eventually have. for (auto method : classType.getOps()) { nameStack.push_back(method.name().str()); auto linkageName = llvm::join(nameStack, "."); nameStack.pop_back(); if (!methodLinkageNames.insert({method.function(), linkageName}).second) method.emitError() << "unbound function shared by multiple methods"; } return success(); } void ObjectGraphGlobalizer::createInitializerFunc() { auto loc = module.getLoc(); auto func = globalBuilder.create( loc, GlobalSlotOp::getGlobalSlotInitializerFuncName(), globalBuilder.getFunctionType({}, {})); OpBuilder builder(func.getContext()); Block *body = builder.createBlock(&func.getBody()); SmallVector opsToMove; for (Operation &op : llvm::make_early_inc_range(*module.getBody())) { if (isa( &op)) continue; op.moveBefore(body, body->end()); for (Value result : llvm::make_early_inc_range(op.getResults())) { auto it = slotInitialValuesInverseMap.find(result); if (it == slotInitialValuesInverseMap.end()) continue; for (AttrOfClass attrOfClass : it->second) { GlobalSlotOp globalSlot = globalSlotForAttr[attrOfClass]; OpBuilder::atBlockEnd(body).create( globalSlot.getLoc(), globalSlot.sym_name(), result); } } } builder.create(loc); } LogicalResult ObjectGraphGlobalizer::rewriteMethods() { DenseMap linkageNames; for (auto classType : module.getOps()) { for (auto method : classType.getOps()) { auto it = methodLinkageNames.find(method.function()); if (it == methodLinkageNames.end()) continue; linkageNames[{classType, method.name()}] = it->second; } } // We only handle a small subset of ops that conform with the set of // assumptions that allow us to globalize the object graph. Anything that // tries to treat modules as bona-fide objects and not just namespaces // of methods with a single instance of the corresponding type just gets // arbitrarily tricky to rewrite. E.g. what if the user creates a list // of modules, or there is an scf.if selecting between modules, etc. auto rewriteOpWithNnModuleTypeOperand = [&](Operation *op) { if (auto primSetAttr = dyn_cast(op)) { auto classType = symbolTable.lookup( primSetAttr.receiver().getType().cast().getClassName()); auto globalSlot = globalSlotForAttr[{classType, primSetAttr.name()}]; OpBuilder(primSetAttr) .create(primSetAttr.getLoc(), globalSlot.sym_name(), primSetAttr.value()); primSetAttr.erase(); } if (auto primGetAttr = dyn_cast(op)) { auto classType = symbolTable.lookup( primGetAttr.receiver().getType().cast().getClassName()); auto globalSlot = globalSlotForAttr[{classType, primGetAttr.name()}]; auto globalSlotGet = OpBuilder(primGetAttr) .create(primGetAttr.getLoc(), primGetAttr.getType(), globalSlot.sym_name()); primGetAttr.replaceAllUsesWith(globalSlotGet.getOperation()); primGetAttr.erase(); } if (auto primCallMethod = dyn_cast(op)) { auto classType = symbolTable.lookup(primCallMethod.receiver() .getType() .cast() .getClassName()); StringRef linkageName = linkageNames[{classType, primCallMethod.name()}]; auto call = OpBuilder(primCallMethod) .create(primCallMethod.getLoc(), linkageName, primCallMethod.getType(), primCallMethod.operands()); primCallMethod.replaceAllUsesWith(call); primCallMethod.erase(); } }; for (auto classType : module.getOps()) { for (auto method : classType.getOps()) { auto it = methodLinkageNames.find(method.function()); if (it == methodLinkageNames.end()) continue; FuncOp func = symbolTable.lookup(method.function()); func.setVisibility(SymbolTable::Visibility::Public); func.setName(it->second); func.walk(rewriteOpWithNnModuleTypeOperand); SmallVector argsToErase; for (auto arg : llvm::enumerate(func.getArguments())) { if (!arg.value().getType().isa()) continue; if (!arg.value().use_empty()) { // TODO: Improve this based on real user use cases. // This is a diagnostic that users will hit if they do not conform to // the supported subset of TorchScript. auto diag = func.emitError().append( "func argument at index ", arg.index(), " has uses that were not able to be converted"); for (Operation *user : arg.value().getUsers()) diag.attachNote(user->getLoc()).append("see user here"); return failure(); } argsToErase.push_back(arg.index()); } func.eraseArguments(argsToErase); } } return success(); } void ObjectGraphGlobalizer::removeObjectGraph() { for (Operation &op : llvm::make_early_inc_range(*module.getBody())) { if (isa(op)) op.erase(); } } namespace { class GlobalizeObjectGraphPass : public GlobalizeObjectGraphBase { void runOnOperation() override { if (failed(ObjectGraphGlobalizer(getOperation()).globalizeObjectGraph())) return signalPassFailure(); } }; } // namespace std::unique_ptr> mlir::NPCOMP::Torch::createGlobalizeObjectGraphPass() { return std::make_unique(); }