| 1 | //===- Pattern.cpp - Pattern wrapper class --------------------------------===// |
| 2 | // |
| 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | // See https://llvm.org/LICENSE.txt for license information. |
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
| 8 | // |
| 9 | // Pattern wrapper class to simplify using TableGen Record defining a MLIR |
| 10 | // Pattern. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include <utility> |
| 15 | |
| 16 | #include "mlir/TableGen/Pattern.h" |
| 17 | #include "llvm/ADT/StringExtras.h" |
| 18 | #include "llvm/ADT/Twine.h" |
| 19 | #include "llvm/Support/Debug.h" |
| 20 | #include "llvm/Support/FormatVariadic.h" |
| 21 | #include "llvm/Support/Path.h" |
| 22 | #include "llvm/TableGen/Error.h" |
| 23 | #include "llvm/TableGen/Record.h" |
| 24 | |
| 25 | #define DEBUG_TYPE "mlir-tblgen-pattern" |
| 26 | |
| 27 | using namespace mlir; |
| 28 | using namespace tblgen; |
| 29 | |
| 30 | using llvm::DagInit; |
| 31 | using llvm::dbgs; |
| 32 | using llvm::DefInit; |
| 33 | using llvm::formatv; |
| 34 | using llvm::IntInit; |
| 35 | using llvm::Record; |
| 36 | |
| 37 | //===----------------------------------------------------------------------===// |
| 38 | // DagLeaf |
| 39 | //===----------------------------------------------------------------------===// |
| 40 | |
| 41 | bool DagLeaf::isUnspecified() const { |
| 42 | return isa_and_nonnull<llvm::UnsetInit>(Val: def); |
| 43 | } |
| 44 | |
| 45 | bool DagLeaf::isOperandMatcher() const { |
| 46 | // Operand matchers specify a type constraint. |
| 47 | return isSubClassOf(superclass: "TypeConstraint" ); |
| 48 | } |
| 49 | |
| 50 | bool DagLeaf::isAttrMatcher() const { |
| 51 | // Attribute matchers specify an attribute constraint. |
| 52 | return isSubClassOf(superclass: "AttrConstraint" ); |
| 53 | } |
| 54 | |
| 55 | bool DagLeaf::isPropMatcher() const { |
| 56 | // Property matchers specify a property constraint. |
| 57 | return isSubClassOf(superclass: "PropConstraint" ); |
| 58 | } |
| 59 | |
| 60 | bool DagLeaf::isPropDefinition() const { |
| 61 | // Property matchers specify a property definition. |
| 62 | return isSubClassOf(superclass: "Property" ); |
| 63 | } |
| 64 | |
| 65 | bool DagLeaf::isNativeCodeCall() const { |
| 66 | return isSubClassOf(superclass: "NativeCodeCall" ); |
| 67 | } |
| 68 | |
| 69 | bool DagLeaf::isConstantAttr() const { return isSubClassOf(superclass: "ConstantAttr" ); } |
| 70 | |
| 71 | bool DagLeaf::isEnumCase() const { return isSubClassOf(superclass: "EnumCase" ); } |
| 72 | |
| 73 | bool DagLeaf::isConstantProp() const { return isSubClassOf(superclass: "ConstantProp" ); } |
| 74 | |
| 75 | bool DagLeaf::isStringAttr() const { return isa<llvm::StringInit>(Val: def); } |
| 76 | |
| 77 | Constraint DagLeaf::getAsConstraint() const { |
| 78 | assert((isOperandMatcher() || isAttrMatcher() || isPropMatcher()) && |
| 79 | "the DAG leaf must be operand, attribute, or property" ); |
| 80 | return Constraint(cast<DefInit>(Val: def)->getDef()); |
| 81 | } |
| 82 | |
| 83 | PropConstraint DagLeaf::getAsPropConstraint() const { |
| 84 | assert(isPropMatcher() && "the DAG leaf must be a property matcher" ); |
| 85 | return PropConstraint(cast<DefInit>(Val: def)->getDef()); |
| 86 | } |
| 87 | |
| 88 | Property DagLeaf::getAsProperty() const { |
| 89 | assert(isPropDefinition() && "the DAG leaf must be a property definition" ); |
| 90 | return Property(cast<DefInit>(Val: def)->getDef()); |
| 91 | } |
| 92 | |
| 93 | ConstantAttr DagLeaf::getAsConstantAttr() const { |
| 94 | assert(isConstantAttr() && "the DAG leaf must be constant attribute" ); |
| 95 | return ConstantAttr(cast<DefInit>(Val: def)); |
| 96 | } |
| 97 | |
| 98 | EnumCase DagLeaf::getAsEnumCase() const { |
| 99 | assert(isEnumCase() && "the DAG leaf must be an enum attribute case" ); |
| 100 | return EnumCase(cast<DefInit>(Val: def)); |
| 101 | } |
| 102 | |
| 103 | ConstantProp DagLeaf::getAsConstantProp() const { |
| 104 | assert(isConstantProp() && "the DAG leaf must be a constant property value" ); |
| 105 | return ConstantProp(cast<DefInit>(Val: def)); |
| 106 | } |
| 107 | |
| 108 | std::string DagLeaf::getConditionTemplate() const { |
| 109 | return getAsConstraint().getConditionTemplate(); |
| 110 | } |
| 111 | |
| 112 | StringRef DagLeaf::getNativeCodeTemplate() const { |
| 113 | assert(isNativeCodeCall() && "the DAG leaf must be NativeCodeCall" ); |
| 114 | return cast<DefInit>(Val: def)->getDef()->getValueAsString(FieldName: "expression" ); |
| 115 | } |
| 116 | |
| 117 | int DagLeaf::getNumReturnsOfNativeCode() const { |
| 118 | assert(isNativeCodeCall() && "the DAG leaf must be NativeCodeCall" ); |
| 119 | return cast<DefInit>(Val: def)->getDef()->getValueAsInt(FieldName: "numReturns" ); |
| 120 | } |
| 121 | |
| 122 | std::string DagLeaf::getStringAttr() const { |
| 123 | assert(isStringAttr() && "the DAG leaf must be string attribute" ); |
| 124 | return def->getAsUnquotedString(); |
| 125 | } |
| 126 | bool DagLeaf::isSubClassOf(StringRef superclass) const { |
| 127 | if (auto *defInit = dyn_cast_or_null<DefInit>(Val: def)) |
| 128 | return defInit->getDef()->isSubClassOf(Name: superclass); |
| 129 | return false; |
| 130 | } |
| 131 | |
| 132 | void DagLeaf::print(raw_ostream &os) const { |
| 133 | if (def) |
| 134 | def->print(OS&: os); |
| 135 | } |
| 136 | |
| 137 | //===----------------------------------------------------------------------===// |
| 138 | // DagNode |
| 139 | //===----------------------------------------------------------------------===// |
| 140 | |
| 141 | bool DagNode::isNativeCodeCall() const { |
| 142 | if (auto *defInit = dyn_cast_or_null<DefInit>(Val: node->getOperator())) |
| 143 | return defInit->getDef()->isSubClassOf(Name: "NativeCodeCall" ); |
| 144 | return false; |
| 145 | } |
| 146 | |
| 147 | bool DagNode::isOperation() const { |
| 148 | return !isNativeCodeCall() && !isReplaceWithValue() && |
| 149 | !isLocationDirective() && !isReturnTypeDirective() && !isEither() && |
| 150 | !isVariadic(); |
| 151 | } |
| 152 | |
| 153 | StringRef DagNode::getNativeCodeTemplate() const { |
| 154 | assert(isNativeCodeCall() && "the DAG leaf must be NativeCodeCall" ); |
| 155 | return cast<DefInit>(Val: node->getOperator()) |
| 156 | ->getDef() |
| 157 | ->getValueAsString(FieldName: "expression" ); |
| 158 | } |
| 159 | |
| 160 | int DagNode::getNumReturnsOfNativeCode() const { |
| 161 | assert(isNativeCodeCall() && "the DAG leaf must be NativeCodeCall" ); |
| 162 | return cast<DefInit>(Val: node->getOperator()) |
| 163 | ->getDef() |
| 164 | ->getValueAsInt(FieldName: "numReturns" ); |
| 165 | } |
| 166 | |
| 167 | StringRef DagNode::getSymbol() const { return node->getNameStr(); } |
| 168 | |
| 169 | Operator &DagNode::getDialectOp(RecordOperatorMap *mapper) const { |
| 170 | const Record *opDef = cast<DefInit>(Val: node->getOperator())->getDef(); |
| 171 | auto [it, inserted] = mapper->try_emplace(Key: opDef); |
| 172 | if (inserted) |
| 173 | it->second = std::make_unique<Operator>(args&: opDef); |
| 174 | return *it->second; |
| 175 | } |
| 176 | |
| 177 | int DagNode::getNumOps() const { |
| 178 | // We want to get number of operations recursively involved in the DAG tree. |
| 179 | // All other directives should be excluded. |
| 180 | int count = isOperation() ? 1 : 0; |
| 181 | for (int i = 0, e = getNumArgs(); i != e; ++i) { |
| 182 | if (auto child = getArgAsNestedDag(index: i)) |
| 183 | count += child.getNumOps(); |
| 184 | } |
| 185 | return count; |
| 186 | } |
| 187 | |
| 188 | int DagNode::getNumArgs() const { return node->getNumArgs(); } |
| 189 | |
| 190 | bool DagNode::isNestedDagArg(unsigned index) const { |
| 191 | return isa<DagInit>(Val: node->getArg(Num: index)); |
| 192 | } |
| 193 | |
| 194 | DagNode DagNode::getArgAsNestedDag(unsigned index) const { |
| 195 | return DagNode(dyn_cast_or_null<DagInit>(Val: node->getArg(Num: index))); |
| 196 | } |
| 197 | |
| 198 | DagLeaf DagNode::getArgAsLeaf(unsigned index) const { |
| 199 | assert(!isNestedDagArg(index)); |
| 200 | return DagLeaf(node->getArg(Num: index)); |
| 201 | } |
| 202 | |
| 203 | StringRef DagNode::getArgName(unsigned index) const { |
| 204 | return node->getArgNameStr(Num: index); |
| 205 | } |
| 206 | |
| 207 | bool DagNode::isReplaceWithValue() const { |
| 208 | auto *dagOpDef = cast<DefInit>(Val: node->getOperator())->getDef(); |
| 209 | return dagOpDef->getName() == "replaceWithValue" ; |
| 210 | } |
| 211 | |
| 212 | bool DagNode::isLocationDirective() const { |
| 213 | auto *dagOpDef = cast<DefInit>(Val: node->getOperator())->getDef(); |
| 214 | return dagOpDef->getName() == "location" ; |
| 215 | } |
| 216 | |
| 217 | bool DagNode::isReturnTypeDirective() const { |
| 218 | auto *dagOpDef = cast<DefInit>(Val: node->getOperator())->getDef(); |
| 219 | return dagOpDef->getName() == "returnType" ; |
| 220 | } |
| 221 | |
| 222 | bool DagNode::isEither() const { |
| 223 | auto *dagOpDef = cast<DefInit>(Val: node->getOperator())->getDef(); |
| 224 | return dagOpDef->getName() == "either" ; |
| 225 | } |
| 226 | |
| 227 | bool DagNode::isVariadic() const { |
| 228 | auto *dagOpDef = cast<DefInit>(Val: node->getOperator())->getDef(); |
| 229 | return dagOpDef->getName() == "variadic" ; |
| 230 | } |
| 231 | |
| 232 | void DagNode::print(raw_ostream &os) const { |
| 233 | if (node) |
| 234 | node->print(OS&: os); |
| 235 | } |
| 236 | |
| 237 | //===----------------------------------------------------------------------===// |
| 238 | // SymbolInfoMap |
| 239 | //===----------------------------------------------------------------------===// |
| 240 | |
| 241 | StringRef SymbolInfoMap::getValuePackName(StringRef symbol, int *index) { |
| 242 | int idx = -1; |
| 243 | auto [name, indexStr] = symbol.rsplit(Separator: "__" ); |
| 244 | |
| 245 | if (indexStr.consumeInteger(Radix: 10, Result&: idx)) { |
| 246 | // The second part is not an index; we return the whole symbol as-is. |
| 247 | return symbol; |
| 248 | } |
| 249 | if (index) { |
| 250 | *index = idx; |
| 251 | } |
| 252 | return name; |
| 253 | } |
| 254 | |
| 255 | SymbolInfoMap::SymbolInfo::SymbolInfo( |
| 256 | const Operator *op, SymbolInfo::Kind kind, |
| 257 | std::optional<DagAndConstant> dagAndConstant) |
| 258 | : op(op), kind(kind), dagAndConstant(dagAndConstant) {} |
| 259 | |
| 260 | int SymbolInfoMap::SymbolInfo::getStaticValueCount() const { |
| 261 | switch (kind) { |
| 262 | case Kind::Attr: |
| 263 | case Kind::Prop: |
| 264 | case Kind::Operand: |
| 265 | case Kind::Value: |
| 266 | return 1; |
| 267 | case Kind::Result: |
| 268 | return op->getNumResults(); |
| 269 | case Kind::MultipleValues: |
| 270 | return getSize(); |
| 271 | } |
| 272 | llvm_unreachable("unknown kind" ); |
| 273 | } |
| 274 | |
| 275 | std::string SymbolInfoMap::SymbolInfo::getVarName(StringRef name) const { |
| 276 | return alternativeName ? *alternativeName : name.str(); |
| 277 | } |
| 278 | |
| 279 | std::string SymbolInfoMap::SymbolInfo::getVarTypeStr(StringRef name) const { |
| 280 | LLVM_DEBUG(dbgs() << "getVarTypeStr for '" << name << "': " ); |
| 281 | switch (kind) { |
| 282 | case Kind::Attr: { |
| 283 | if (op) |
| 284 | return cast<NamedAttribute *>(Val: op->getArg(index: getArgIndex())) |
| 285 | ->attr.getStorageType() |
| 286 | .str(); |
| 287 | // TODO(suderman): Use a more exact type when available. |
| 288 | return "::mlir::Attribute" ; |
| 289 | } |
| 290 | case Kind::Prop: { |
| 291 | if (op) |
| 292 | return cast<NamedProperty *>(Val: op->getArg(index: getArgIndex())) |
| 293 | ->prop.getInterfaceType() |
| 294 | .str(); |
| 295 | assert(dagAndConstant && dagAndConstant->dag && |
| 296 | "generic properties must carry their constraint" ); |
| 297 | return reinterpret_cast<const DagLeaf *>(dagAndConstant->dag) |
| 298 | ->getAsPropConstraint() |
| 299 | .getInterfaceType() |
| 300 | .str(); |
| 301 | } |
| 302 | case Kind::Operand: { |
| 303 | // Use operand range for captured operands (to support potential variadic |
| 304 | // operands). |
| 305 | return "::mlir::Operation::operand_range" ; |
| 306 | } |
| 307 | case Kind::Value: { |
| 308 | return "::mlir::Value" ; |
| 309 | } |
| 310 | case Kind::MultipleValues: { |
| 311 | return "::mlir::ValueRange" ; |
| 312 | } |
| 313 | case Kind::Result: { |
| 314 | // Use the op itself for captured results. |
| 315 | return op->getQualCppClassName(); |
| 316 | } |
| 317 | } |
| 318 | llvm_unreachable("unknown kind" ); |
| 319 | } |
| 320 | |
| 321 | std::string SymbolInfoMap::SymbolInfo::getVarDecl(StringRef name) const { |
| 322 | LLVM_DEBUG(dbgs() << "getVarDecl for '" << name << "': " ); |
| 323 | std::string varInit = kind == Kind::Operand ? "(op0->getOperands())" : "" ; |
| 324 | return std::string( |
| 325 | formatv(Fmt: "{0} {1}{2};\n" , Vals: getVarTypeStr(name), Vals: getVarName(name), Vals&: varInit)); |
| 326 | } |
| 327 | |
| 328 | std::string SymbolInfoMap::SymbolInfo::getArgDecl(StringRef name) const { |
| 329 | LLVM_DEBUG(dbgs() << "getArgDecl for '" << name << "': " ); |
| 330 | return std::string( |
| 331 | formatv(Fmt: "{0} &{1}" , Vals: getVarTypeStr(name), Vals: getVarName(name))); |
| 332 | } |
| 333 | |
| 334 | std::string SymbolInfoMap::SymbolInfo::getValueAndRangeUse( |
| 335 | StringRef name, int index, const char *fmt, const char *separator) const { |
| 336 | LLVM_DEBUG(dbgs() << "getValueAndRangeUse for '" << name << "': " ); |
| 337 | switch (kind) { |
| 338 | case Kind::Attr: { |
| 339 | assert(index < 0); |
| 340 | auto repl = formatv(Fmt: fmt, Vals&: name); |
| 341 | LLVM_DEBUG(dbgs() << repl << " (Attr)\n" ); |
| 342 | return std::string(repl); |
| 343 | } |
| 344 | case Kind::Prop: { |
| 345 | assert(index < 0); |
| 346 | auto repl = formatv(Fmt: fmt, Vals&: name); |
| 347 | LLVM_DEBUG(dbgs() << repl << " (Prop)\n" ); |
| 348 | return std::string(repl); |
| 349 | } |
| 350 | case Kind::Operand: { |
| 351 | assert(index < 0); |
| 352 | auto *operand = cast<NamedTypeConstraint *>(Val: op->getArg(index: getArgIndex())); |
| 353 | if (operand->isOptional()) { |
| 354 | auto repl = formatv( |
| 355 | Fmt: fmt, Vals: formatv(Fmt: "({0}.empty() ? ::mlir::Value() : *{0}.begin())" , Vals&: name)); |
| 356 | LLVM_DEBUG(dbgs() << repl << " (OptionalOperand)\n" ); |
| 357 | return std::string(repl); |
| 358 | } |
| 359 | // If this operand is variadic and this SymbolInfo doesn't have a range |
| 360 | // index, then return the full variadic operand_range. Otherwise, return |
| 361 | // the value itself. |
| 362 | if (operand->isVariableLength() && !getVariadicSubIndex().has_value()) { |
| 363 | auto repl = formatv(Fmt: fmt, Vals&: name); |
| 364 | LLVM_DEBUG(dbgs() << repl << " (VariadicOperand)\n" ); |
| 365 | return std::string(repl); |
| 366 | } |
| 367 | auto repl = formatv(Fmt: fmt, Vals: formatv(Fmt: "(*{0}.begin())" , Vals&: name)); |
| 368 | LLVM_DEBUG(dbgs() << repl << " (SingleOperand)\n" ); |
| 369 | return std::string(repl); |
| 370 | } |
| 371 | case Kind::Result: { |
| 372 | // If `index` is greater than zero, then we are referencing a specific |
| 373 | // result of a multi-result op. The result can still be variadic. |
| 374 | if (index >= 0) { |
| 375 | std::string v = |
| 376 | std::string(formatv(Fmt: "{0}.getODSResults({1})" , Vals&: name, Vals&: index)); |
| 377 | if (!op->getResult(index).isVariadic()) |
| 378 | v = std::string(formatv(Fmt: "(*{0}.begin())" , Vals&: v)); |
| 379 | auto repl = formatv(Fmt: fmt, Vals&: v); |
| 380 | LLVM_DEBUG(dbgs() << repl << " (SingleResult)\n" ); |
| 381 | return std::string(repl); |
| 382 | } |
| 383 | |
| 384 | // If this op has no result at all but still we bind a symbol to it, it |
| 385 | // means we want to capture the op itself. |
| 386 | if (op->getNumResults() == 0) { |
| 387 | LLVM_DEBUG(dbgs() << name << " (Op)\n" ); |
| 388 | return formatv(Fmt: fmt, Vals&: name); |
| 389 | } |
| 390 | |
| 391 | // We are referencing all results of the multi-result op. A specific result |
| 392 | // can either be a value or a range. Then join them with `separator`. |
| 393 | SmallVector<std::string, 4> values; |
| 394 | values.reserve(N: op->getNumResults()); |
| 395 | |
| 396 | for (int i = 0, e = op->getNumResults(); i < e; ++i) { |
| 397 | std::string v = std::string(formatv(Fmt: "{0}.getODSResults({1})" , Vals&: name, Vals&: i)); |
| 398 | if (!op->getResult(index: i).isVariadic()) { |
| 399 | v = std::string(formatv(Fmt: "(*{0}.begin())" , Vals&: v)); |
| 400 | } |
| 401 | values.push_back(Elt: std::string(formatv(Fmt: fmt, Vals&: v))); |
| 402 | } |
| 403 | auto repl = llvm::join(R&: values, Separator: separator); |
| 404 | LLVM_DEBUG(dbgs() << repl << " (VariadicResult)\n" ); |
| 405 | return repl; |
| 406 | } |
| 407 | case Kind::Value: { |
| 408 | assert(index < 0); |
| 409 | assert(op == nullptr); |
| 410 | auto repl = formatv(Fmt: fmt, Vals&: name); |
| 411 | LLVM_DEBUG(dbgs() << repl << " (Value)\n" ); |
| 412 | return std::string(repl); |
| 413 | } |
| 414 | case Kind::MultipleValues: { |
| 415 | assert(op == nullptr); |
| 416 | assert(index < getSize()); |
| 417 | if (index >= 0) { |
| 418 | std::string repl = |
| 419 | formatv(Fmt: fmt, Vals: std::string(formatv(Fmt: "{0}[{1}]" , Vals&: name, Vals&: index))); |
| 420 | LLVM_DEBUG(dbgs() << repl << " (MultipleValues)\n" ); |
| 421 | return repl; |
| 422 | } |
| 423 | // If it doesn't specify certain element, unpack them all. |
| 424 | auto repl = |
| 425 | formatv(Fmt: fmt, Vals: std::string(formatv(Fmt: "{0}.begin(), {0}.end()" , Vals&: name))); |
| 426 | LLVM_DEBUG(dbgs() << repl << " (MultipleValues)\n" ); |
| 427 | return std::string(repl); |
| 428 | } |
| 429 | } |
| 430 | llvm_unreachable("unknown kind" ); |
| 431 | } |
| 432 | |
| 433 | std::string SymbolInfoMap::SymbolInfo::getAllRangeUse( |
| 434 | StringRef name, int index, const char *fmt, const char *separator) const { |
| 435 | LLVM_DEBUG(dbgs() << "getAllRangeUse for '" << name << "': " ); |
| 436 | switch (kind) { |
| 437 | case Kind::Attr: |
| 438 | case Kind::Prop: |
| 439 | case Kind::Operand: { |
| 440 | assert(index < 0 && "only allowed for symbol bound to result" ); |
| 441 | auto repl = formatv(Fmt: fmt, Vals&: name); |
| 442 | LLVM_DEBUG(dbgs() << repl << " (Operand/Attr/Prop)\n" ); |
| 443 | return std::string(repl); |
| 444 | } |
| 445 | case Kind::Result: { |
| 446 | if (index >= 0) { |
| 447 | auto repl = formatv(Fmt: fmt, Vals: formatv(Fmt: "{0}.getODSResults({1})" , Vals&: name, Vals&: index)); |
| 448 | LLVM_DEBUG(dbgs() << repl << " (SingleResult)\n" ); |
| 449 | return std::string(repl); |
| 450 | } |
| 451 | |
| 452 | // We are referencing all results of the multi-result op. Each result should |
| 453 | // have a value range, and then join them with `separator`. |
| 454 | SmallVector<std::string, 4> values; |
| 455 | values.reserve(N: op->getNumResults()); |
| 456 | |
| 457 | for (int i = 0, e = op->getNumResults(); i < e; ++i) { |
| 458 | values.push_back(Elt: std::string( |
| 459 | formatv(Fmt: fmt, Vals: formatv(Fmt: "{0}.getODSResults({1})" , Vals&: name, Vals&: i)))); |
| 460 | } |
| 461 | auto repl = llvm::join(R&: values, Separator: separator); |
| 462 | LLVM_DEBUG(dbgs() << repl << " (VariadicResult)\n" ); |
| 463 | return repl; |
| 464 | } |
| 465 | case Kind::Value: { |
| 466 | assert(index < 0 && "only allowed for symbol bound to result" ); |
| 467 | assert(op == nullptr); |
| 468 | auto repl = formatv(Fmt: fmt, Vals: formatv(Fmt: "{{{0}}" , Vals&: name)); |
| 469 | LLVM_DEBUG(dbgs() << repl << " (Value)\n" ); |
| 470 | return std::string(repl); |
| 471 | } |
| 472 | case Kind::MultipleValues: { |
| 473 | assert(op == nullptr); |
| 474 | assert(index < getSize()); |
| 475 | if (index >= 0) { |
| 476 | std::string repl = |
| 477 | formatv(Fmt: fmt, Vals: std::string(formatv(Fmt: "{0}[{1}]" , Vals&: name, Vals&: index))); |
| 478 | LLVM_DEBUG(dbgs() << repl << " (MultipleValues)\n" ); |
| 479 | return repl; |
| 480 | } |
| 481 | auto repl = |
| 482 | formatv(Fmt: fmt, Vals: std::string(formatv(Fmt: "{0}.begin(), {0}.end()" , Vals&: name))); |
| 483 | LLVM_DEBUG(dbgs() << repl << " (MultipleValues)\n" ); |
| 484 | return std::string(repl); |
| 485 | } |
| 486 | } |
| 487 | llvm_unreachable("unknown kind" ); |
| 488 | } |
| 489 | |
| 490 | bool SymbolInfoMap::bindOpArgument(DagNode node, StringRef symbol, |
| 491 | const Operator &op, int argIndex, |
| 492 | std::optional<int> variadicSubIndex) { |
| 493 | StringRef name = getValuePackName(symbol); |
| 494 | if (name != symbol) { |
| 495 | auto error = formatv( |
| 496 | Fmt: "symbol '{0}' with trailing index cannot bind to op argument" , Vals&: symbol); |
| 497 | PrintFatalError(ErrorLoc: loc, Msg: error); |
| 498 | } |
| 499 | |
| 500 | Argument arg = op.getArg(index: argIndex); |
| 501 | SymbolInfo symInfo = |
| 502 | isa<NamedAttribute *>(Val: arg) ? SymbolInfo::getAttr(op: &op, index: argIndex) |
| 503 | : isa<NamedProperty *>(Val: arg) |
| 504 | ? SymbolInfo::getProp(op: &op, index: argIndex) |
| 505 | : SymbolInfo::getOperand(node, op: &op, operandIndex: argIndex, variadicSubIndex); |
| 506 | |
| 507 | std::string key = symbol.str(); |
| 508 | if (symbolInfoMap.count(x: key)) { |
| 509 | // Only non unique name for the operand is supported. |
| 510 | if (symInfo.kind != SymbolInfo::Kind::Operand) { |
| 511 | return false; |
| 512 | } |
| 513 | |
| 514 | // Cannot add new operand if there is already non operand with the same |
| 515 | // name. |
| 516 | if (symbolInfoMap.find(x: key)->second.kind != SymbolInfo::Kind::Operand) { |
| 517 | return false; |
| 518 | } |
| 519 | } |
| 520 | |
| 521 | symbolInfoMap.emplace(args&: key, args&: symInfo); |
| 522 | return true; |
| 523 | } |
| 524 | |
| 525 | bool SymbolInfoMap::bindOpResult(StringRef symbol, const Operator &op) { |
| 526 | std::string name = getValuePackName(symbol).str(); |
| 527 | auto inserted = symbolInfoMap.emplace(args&: name, args: SymbolInfo::getResult(op: &op)); |
| 528 | |
| 529 | return symbolInfoMap.count(x: inserted->first) == 1; |
| 530 | } |
| 531 | |
| 532 | bool SymbolInfoMap::bindValues(StringRef symbol, int numValues) { |
| 533 | std::string name = getValuePackName(symbol).str(); |
| 534 | if (numValues > 1) |
| 535 | return bindMultipleValues(symbol: name, numValues); |
| 536 | return bindValue(symbol: name); |
| 537 | } |
| 538 | |
| 539 | bool SymbolInfoMap::bindValue(StringRef symbol) { |
| 540 | auto inserted = symbolInfoMap.emplace(args: symbol.str(), args: SymbolInfo::getValue()); |
| 541 | return symbolInfoMap.count(x: inserted->first) == 1; |
| 542 | } |
| 543 | |
| 544 | bool SymbolInfoMap::bindMultipleValues(StringRef symbol, int numValues) { |
| 545 | std::string name = getValuePackName(symbol).str(); |
| 546 | auto inserted = |
| 547 | symbolInfoMap.emplace(args&: name, args: SymbolInfo::getMultipleValues(numValues)); |
| 548 | return symbolInfoMap.count(x: inserted->first) == 1; |
| 549 | } |
| 550 | |
| 551 | bool SymbolInfoMap::bindAttr(StringRef symbol) { |
| 552 | auto inserted = symbolInfoMap.emplace(args: symbol.str(), args: SymbolInfo::getAttr()); |
| 553 | return symbolInfoMap.count(x: inserted->first) == 1; |
| 554 | } |
| 555 | |
| 556 | bool SymbolInfoMap::bindProp(StringRef symbol, |
| 557 | const PropConstraint &constraint) { |
| 558 | auto inserted = |
| 559 | symbolInfoMap.emplace(args: symbol.str(), args: SymbolInfo::getProp(constraint: &constraint)); |
| 560 | return symbolInfoMap.count(x: inserted->first) == 1; |
| 561 | } |
| 562 | |
| 563 | bool SymbolInfoMap::contains(StringRef symbol) const { |
| 564 | return find(key: symbol) != symbolInfoMap.end(); |
| 565 | } |
| 566 | |
| 567 | SymbolInfoMap::const_iterator SymbolInfoMap::find(StringRef key) const { |
| 568 | std::string name = getValuePackName(symbol: key).str(); |
| 569 | |
| 570 | return symbolInfoMap.find(x: name); |
| 571 | } |
| 572 | |
| 573 | SymbolInfoMap::const_iterator |
| 574 | SymbolInfoMap::findBoundSymbol(StringRef key, DagNode node, const Operator &op, |
| 575 | int argIndex, |
| 576 | std::optional<int> variadicSubIndex) const { |
| 577 | return findBoundSymbol( |
| 578 | key, symbolInfo: SymbolInfo::getOperand(node, op: &op, operandIndex: argIndex, variadicSubIndex)); |
| 579 | } |
| 580 | |
| 581 | SymbolInfoMap::const_iterator |
| 582 | SymbolInfoMap::findBoundSymbol(StringRef key, |
| 583 | const SymbolInfo &symbolInfo) const { |
| 584 | std::string name = getValuePackName(symbol: key).str(); |
| 585 | auto range = symbolInfoMap.equal_range(x: name); |
| 586 | |
| 587 | for (auto it = range.first; it != range.second; ++it) |
| 588 | if (it->second.dagAndConstant == symbolInfo.dagAndConstant) |
| 589 | return it; |
| 590 | |
| 591 | return symbolInfoMap.end(); |
| 592 | } |
| 593 | |
| 594 | std::pair<SymbolInfoMap::iterator, SymbolInfoMap::iterator> |
| 595 | SymbolInfoMap::getRangeOfEqualElements(StringRef key) { |
| 596 | std::string name = getValuePackName(symbol: key).str(); |
| 597 | |
| 598 | return symbolInfoMap.equal_range(x: name); |
| 599 | } |
| 600 | |
| 601 | int SymbolInfoMap::count(StringRef key) const { |
| 602 | std::string name = getValuePackName(symbol: key).str(); |
| 603 | return symbolInfoMap.count(x: name); |
| 604 | } |
| 605 | |
| 606 | int SymbolInfoMap::getStaticValueCount(StringRef symbol) const { |
| 607 | StringRef name = getValuePackName(symbol); |
| 608 | if (name != symbol) { |
| 609 | // If there is a trailing index inside symbol, it references just one |
| 610 | // static value. |
| 611 | return 1; |
| 612 | } |
| 613 | // Otherwise, find how many it represents by querying the symbol's info. |
| 614 | return find(key: name)->second.getStaticValueCount(); |
| 615 | } |
| 616 | |
| 617 | std::string SymbolInfoMap::getValueAndRangeUse(StringRef symbol, |
| 618 | const char *fmt, |
| 619 | const char *separator) const { |
| 620 | int index = -1; |
| 621 | StringRef name = getValuePackName(symbol, index: &index); |
| 622 | |
| 623 | auto it = symbolInfoMap.find(x: name.str()); |
| 624 | if (it == symbolInfoMap.end()) { |
| 625 | auto error = formatv(Fmt: "referencing unbound symbol '{0}'" , Vals&: symbol); |
| 626 | PrintFatalError(ErrorLoc: loc, Msg: error); |
| 627 | } |
| 628 | |
| 629 | return it->second.getValueAndRangeUse(name, index, fmt, separator); |
| 630 | } |
| 631 | |
| 632 | std::string SymbolInfoMap::getAllRangeUse(StringRef symbol, const char *fmt, |
| 633 | const char *separator) const { |
| 634 | int index = -1; |
| 635 | StringRef name = getValuePackName(symbol, index: &index); |
| 636 | |
| 637 | auto it = symbolInfoMap.find(x: name.str()); |
| 638 | if (it == symbolInfoMap.end()) { |
| 639 | auto error = formatv(Fmt: "referencing unbound symbol '{0}'" , Vals&: symbol); |
| 640 | PrintFatalError(ErrorLoc: loc, Msg: error); |
| 641 | } |
| 642 | |
| 643 | return it->second.getAllRangeUse(name, index, fmt, separator); |
| 644 | } |
| 645 | |
| 646 | void SymbolInfoMap::assignUniqueAlternativeNames() { |
| 647 | llvm::StringSet<> usedNames; |
| 648 | |
| 649 | for (auto symbolInfoIt = symbolInfoMap.begin(); |
| 650 | symbolInfoIt != symbolInfoMap.end();) { |
| 651 | auto range = symbolInfoMap.equal_range(x: symbolInfoIt->first); |
| 652 | auto startRange = range.first; |
| 653 | auto endRange = range.second; |
| 654 | |
| 655 | auto operandName = symbolInfoIt->first; |
| 656 | int startSearchIndex = 0; |
| 657 | for (++startRange; startRange != endRange; ++startRange) { |
| 658 | // Current operand name is not unique, find a unique one |
| 659 | // and set the alternative name. |
| 660 | for (int i = startSearchIndex;; ++i) { |
| 661 | std::string alternativeName = operandName + std::to_string(val: i); |
| 662 | if (!usedNames.contains(key: alternativeName) && |
| 663 | symbolInfoMap.count(x: alternativeName) == 0) { |
| 664 | usedNames.insert(key: alternativeName); |
| 665 | startRange->second.alternativeName = alternativeName; |
| 666 | startSearchIndex = i + 1; |
| 667 | |
| 668 | break; |
| 669 | } |
| 670 | } |
| 671 | } |
| 672 | |
| 673 | symbolInfoIt = endRange; |
| 674 | } |
| 675 | } |
| 676 | |
| 677 | //===----------------------------------------------------------------------===// |
| 678 | // Pattern |
| 679 | //==----------------------------------------------------------------------===// |
| 680 | |
| 681 | Pattern::Pattern(const Record *def, RecordOperatorMap *mapper) |
| 682 | : def(*def), recordOpMap(mapper) {} |
| 683 | |
| 684 | DagNode Pattern::getSourcePattern() const { |
| 685 | return DagNode(def.getValueAsDag(FieldName: "sourcePattern" )); |
| 686 | } |
| 687 | |
| 688 | int Pattern::getNumResultPatterns() const { |
| 689 | auto *results = def.getValueAsListInit(FieldName: "resultPatterns" ); |
| 690 | return results->size(); |
| 691 | } |
| 692 | |
| 693 | DagNode Pattern::getResultPattern(unsigned index) const { |
| 694 | auto *results = def.getValueAsListInit(FieldName: "resultPatterns" ); |
| 695 | return DagNode(cast<DagInit>(Val: results->getElement(Idx: index))); |
| 696 | } |
| 697 | |
| 698 | void Pattern::collectSourcePatternBoundSymbols(SymbolInfoMap &infoMap) { |
| 699 | LLVM_DEBUG(dbgs() << "start collecting source pattern bound symbols\n" ); |
| 700 | collectBoundSymbols(tree: getSourcePattern(), infoMap, /*isSrcPattern=*/true); |
| 701 | LLVM_DEBUG(dbgs() << "done collecting source pattern bound symbols\n" ); |
| 702 | |
| 703 | LLVM_DEBUG(dbgs() << "start assigning alternative names for symbols\n" ); |
| 704 | infoMap.assignUniqueAlternativeNames(); |
| 705 | LLVM_DEBUG(dbgs() << "done assigning alternative names for symbols\n" ); |
| 706 | } |
| 707 | |
| 708 | void Pattern::collectResultPatternBoundSymbols(SymbolInfoMap &infoMap) { |
| 709 | LLVM_DEBUG(dbgs() << "start collecting result pattern bound symbols\n" ); |
| 710 | for (int i = 0, e = getNumResultPatterns(); i < e; ++i) { |
| 711 | auto pattern = getResultPattern(index: i); |
| 712 | collectBoundSymbols(tree: pattern, infoMap, /*isSrcPattern=*/false); |
| 713 | } |
| 714 | LLVM_DEBUG(dbgs() << "done collecting result pattern bound symbols\n" ); |
| 715 | } |
| 716 | |
| 717 | const Operator &Pattern::getSourceRootOp() { |
| 718 | return getSourcePattern().getDialectOp(mapper: recordOpMap); |
| 719 | } |
| 720 | |
| 721 | Operator &Pattern::getDialectOp(DagNode node) { |
| 722 | return node.getDialectOp(mapper: recordOpMap); |
| 723 | } |
| 724 | |
| 725 | std::vector<AppliedConstraint> Pattern::getConstraints() const { |
| 726 | auto *listInit = def.getValueAsListInit(FieldName: "constraints" ); |
| 727 | std::vector<AppliedConstraint> ret; |
| 728 | ret.reserve(n: listInit->size()); |
| 729 | |
| 730 | for (auto *it : *listInit) { |
| 731 | auto *dagInit = dyn_cast<DagInit>(Val: it); |
| 732 | if (!dagInit) |
| 733 | PrintFatalError(Rec: &def, Msg: "all elements in Pattern multi-entity " |
| 734 | "constraints should be DAG nodes" ); |
| 735 | |
| 736 | std::vector<std::string> entities; |
| 737 | entities.reserve(n: dagInit->arg_size()); |
| 738 | for (auto *argName : dagInit->getArgNames()) { |
| 739 | if (!argName) { |
| 740 | PrintFatalError( |
| 741 | Rec: &def, |
| 742 | Msg: "operands to additional constraints can only be symbol references" ); |
| 743 | } |
| 744 | entities.emplace_back(args: argName->getValue()); |
| 745 | } |
| 746 | |
| 747 | ret.emplace_back(args: cast<DefInit>(Val: dagInit->getOperator())->getDef(), |
| 748 | args: dagInit->getNameStr(), args: std::move(entities)); |
| 749 | } |
| 750 | return ret; |
| 751 | } |
| 752 | |
| 753 | int Pattern::getNumSupplementalPatterns() const { |
| 754 | auto *results = def.getValueAsListInit(FieldName: "supplementalPatterns" ); |
| 755 | return results->size(); |
| 756 | } |
| 757 | |
| 758 | DagNode Pattern::getSupplementalPattern(unsigned index) const { |
| 759 | auto *results = def.getValueAsListInit(FieldName: "supplementalPatterns" ); |
| 760 | return DagNode(cast<DagInit>(Val: results->getElement(Idx: index))); |
| 761 | } |
| 762 | |
| 763 | int Pattern::getBenefit() const { |
| 764 | // The initial benefit value is a heuristic with number of ops in the source |
| 765 | // pattern. |
| 766 | int initBenefit = getSourcePattern().getNumOps(); |
| 767 | const DagInit *delta = def.getValueAsDag(FieldName: "benefitDelta" ); |
| 768 | if (delta->getNumArgs() != 1 || !isa<IntInit>(Val: delta->getArg(Num: 0))) { |
| 769 | PrintFatalError(Rec: &def, |
| 770 | Msg: "The 'addBenefit' takes and only takes one integer value" ); |
| 771 | } |
| 772 | return initBenefit + dyn_cast<IntInit>(Val: delta->getArg(Num: 0))->getValue(); |
| 773 | } |
| 774 | |
| 775 | std::vector<Pattern::IdentifierLine> |
| 776 | Pattern::getLocation(bool forSourceOutput) const { |
| 777 | std::vector<std::pair<StringRef, unsigned>> result; |
| 778 | result.reserve(n: def.getLoc().size()); |
| 779 | for (auto loc : def.getLoc()) { |
| 780 | unsigned buf = llvm::SrcMgr.FindBufferContainingLoc(Loc: loc); |
| 781 | assert(buf && "invalid source location" ); |
| 782 | |
| 783 | StringRef bufferName = |
| 784 | llvm::SrcMgr.getBufferInfo(i: buf).Buffer->getBufferIdentifier(); |
| 785 | // If we're emitting a generated file, we'd like to have some indication of |
| 786 | // where our patterns came from. However, LLVM's build rules use absolute |
| 787 | // paths as arguments to TableGen, and naively echoing such paths makes the |
| 788 | // contents of the generated source file depend on the build location, |
| 789 | // making MLIR builds substantially less reproducable. As a compromise, we |
| 790 | // trim absolute paths back to only the filename component. |
| 791 | if (forSourceOutput && llvm::sys::path::is_absolute(path: bufferName)) |
| 792 | bufferName = llvm::sys::path::filename(path: bufferName); |
| 793 | |
| 794 | result.emplace_back(args&: bufferName, |
| 795 | args: llvm::SrcMgr.getLineAndColumn(Loc: loc, BufferID: buf).first); |
| 796 | } |
| 797 | return result; |
| 798 | } |
| 799 | |
| 800 | void Pattern::verifyBind(bool result, StringRef symbolName) { |
| 801 | if (!result) { |
| 802 | auto err = formatv(Fmt: "symbol '{0}' bound more than once" , Vals&: symbolName); |
| 803 | PrintFatalError(Rec: &def, Msg: err); |
| 804 | } |
| 805 | } |
| 806 | |
| 807 | void Pattern::collectBoundSymbols(DagNode tree, SymbolInfoMap &infoMap, |
| 808 | bool isSrcPattern) { |
| 809 | auto treeName = tree.getSymbol(); |
| 810 | auto numTreeArgs = tree.getNumArgs(); |
| 811 | |
| 812 | if (tree.isNativeCodeCall()) { |
| 813 | if (!treeName.empty()) { |
| 814 | if (!isSrcPattern) { |
| 815 | LLVM_DEBUG(dbgs() << "found symbol bound to NativeCodeCall: " |
| 816 | << treeName << '\n'); |
| 817 | verifyBind( |
| 818 | result: infoMap.bindValues(symbol: treeName, numValues: tree.getNumReturnsOfNativeCode()), |
| 819 | symbolName: treeName); |
| 820 | } else { |
| 821 | PrintFatalError(Rec: &def, |
| 822 | Msg: formatv(Fmt: "binding symbol '{0}' to NativecodeCall in " |
| 823 | "MatchPattern is not supported" , |
| 824 | Vals&: treeName)); |
| 825 | } |
| 826 | } |
| 827 | |
| 828 | for (int i = 0; i != numTreeArgs; ++i) { |
| 829 | if (auto treeArg = tree.getArgAsNestedDag(index: i)) { |
| 830 | // This DAG node argument is a DAG node itself. Go inside recursively. |
| 831 | collectBoundSymbols(tree: treeArg, infoMap, isSrcPattern); |
| 832 | continue; |
| 833 | } |
| 834 | |
| 835 | if (!isSrcPattern) |
| 836 | continue; |
| 837 | |
| 838 | // We can only bind symbols to arguments in source pattern. Those |
| 839 | // symbols are referenced in result patterns. |
| 840 | auto treeArgName = tree.getArgName(index: i); |
| 841 | |
| 842 | // `$_` is a special symbol meaning ignore the current argument. |
| 843 | if (!treeArgName.empty() && treeArgName != "_" ) { |
| 844 | DagLeaf leaf = tree.getArgAsLeaf(index: i); |
| 845 | |
| 846 | // In (NativeCodeCall<"Foo($_self, $0, $1, $2, $3)"> I8Attr:$a, I8:$b, |
| 847 | // $c, I8Prop:$d), |
| 848 | if (leaf.isUnspecified()) { |
| 849 | // This is case of $c, a Value without any constraints. |
| 850 | verifyBind(result: infoMap.bindValue(symbol: treeArgName), symbolName: treeArgName); |
| 851 | } else if (leaf.isPropMatcher()) { |
| 852 | // This is case of $d, a binding to a certain property. |
| 853 | auto propConstraint = leaf.getAsPropConstraint(); |
| 854 | if (propConstraint.getInterfaceType().empty()) { |
| 855 | PrintFatalError(Rec: &def, |
| 856 | Msg: formatv(Fmt: "binding symbol '{0}' in NativeCodeCall to " |
| 857 | "a property constraint without specifying " |
| 858 | "that constraint's type is unsupported" , |
| 859 | Vals&: treeArgName)); |
| 860 | } |
| 861 | verifyBind(result: infoMap.bindProp(symbol: treeArgName, constraint: propConstraint), |
| 862 | symbolName: treeArgName); |
| 863 | } else { |
| 864 | auto constraint = leaf.getAsConstraint(); |
| 865 | bool isAttr = leaf.isAttrMatcher() || leaf.isEnumCase() || |
| 866 | leaf.isConstantAttr() || |
| 867 | constraint.getKind() == Constraint::Kind::CK_Attr; |
| 868 | |
| 869 | if (isAttr) { |
| 870 | // This is case of $a, a binding to a certain attribute. |
| 871 | verifyBind(result: infoMap.bindAttr(symbol: treeArgName), symbolName: treeArgName); |
| 872 | continue; |
| 873 | } |
| 874 | |
| 875 | // This is case of $b, a binding to a certain type. |
| 876 | verifyBind(result: infoMap.bindValue(symbol: treeArgName), symbolName: treeArgName); |
| 877 | } |
| 878 | } |
| 879 | } |
| 880 | |
| 881 | return; |
| 882 | } |
| 883 | |
| 884 | if (tree.isOperation()) { |
| 885 | auto &op = getDialectOp(node: tree); |
| 886 | auto numOpArgs = op.getNumArgs(); |
| 887 | int numEither = 0; |
| 888 | |
| 889 | // We need to exclude the trailing directives and `either` directive groups |
| 890 | // two operands of the operation. |
| 891 | int numDirectives = 0; |
| 892 | for (int i = numTreeArgs - 1; i >= 0; --i) { |
| 893 | if (auto dagArg = tree.getArgAsNestedDag(index: i)) { |
| 894 | if (dagArg.isLocationDirective() || dagArg.isReturnTypeDirective()) |
| 895 | ++numDirectives; |
| 896 | else if (dagArg.isEither()) |
| 897 | ++numEither; |
| 898 | } |
| 899 | } |
| 900 | |
| 901 | if (numOpArgs != numTreeArgs - numDirectives + numEither) { |
| 902 | auto err = |
| 903 | formatv(Fmt: "op '{0}' argument number mismatch: " |
| 904 | "{1} in pattern vs. {2} in definition" , |
| 905 | Vals: op.getOperationName(), Vals: numTreeArgs + numEither, Vals&: numOpArgs); |
| 906 | PrintFatalError(Rec: &def, Msg: err); |
| 907 | } |
| 908 | |
| 909 | // The name attached to the DAG node's operator is for representing the |
| 910 | // results generated from this op. It should be remembered as bound results. |
| 911 | if (!treeName.empty()) { |
| 912 | LLVM_DEBUG(dbgs() << "found symbol bound to op result: " << treeName |
| 913 | << '\n'); |
| 914 | verifyBind(result: infoMap.bindOpResult(symbol: treeName, op), symbolName: treeName); |
| 915 | } |
| 916 | |
| 917 | // The operand in `either` DAG should be bound to the operation in the |
| 918 | // parent DagNode. |
| 919 | auto collectSymbolInEither = [&](DagNode parent, DagNode tree, |
| 920 | int opArgIdx) { |
| 921 | for (int i = 0; i < tree.getNumArgs(); ++i, ++opArgIdx) { |
| 922 | if (DagNode subTree = tree.getArgAsNestedDag(index: i)) { |
| 923 | collectBoundSymbols(tree: subTree, infoMap, isSrcPattern); |
| 924 | } else { |
| 925 | auto argName = tree.getArgName(index: i); |
| 926 | if (!argName.empty() && argName != "_" ) { |
| 927 | verifyBind(result: infoMap.bindOpArgument(node: parent, symbol: argName, op, argIndex: opArgIdx), |
| 928 | symbolName: argName); |
| 929 | } |
| 930 | } |
| 931 | } |
| 932 | }; |
| 933 | |
| 934 | // The operand in `variadic` DAG should be bound to the operation in the |
| 935 | // parent DagNode. The range index must be included as well to distinguish |
| 936 | // (potentially) repeating argName within the `variadic` DAG. |
| 937 | auto collectSymbolInVariadic = [&](DagNode parent, DagNode tree, |
| 938 | int opArgIdx) { |
| 939 | auto treeName = tree.getSymbol(); |
| 940 | if (!treeName.empty()) { |
| 941 | // If treeName is specified, bind to the full variadic operand_range. |
| 942 | verifyBind(result: infoMap.bindOpArgument(node: parent, symbol: treeName, op, argIndex: opArgIdx, |
| 943 | variadicSubIndex: std::nullopt), |
| 944 | symbolName: treeName); |
| 945 | } |
| 946 | |
| 947 | for (int i = 0; i < tree.getNumArgs(); ++i) { |
| 948 | if (DagNode subTree = tree.getArgAsNestedDag(index: i)) { |
| 949 | collectBoundSymbols(tree: subTree, infoMap, isSrcPattern); |
| 950 | } else { |
| 951 | auto argName = tree.getArgName(index: i); |
| 952 | if (!argName.empty() && argName != "_" ) { |
| 953 | verifyBind(result: infoMap.bindOpArgument(node: parent, symbol: argName, op, argIndex: opArgIdx, |
| 954 | /*variadicSubIndex=*/i), |
| 955 | symbolName: argName); |
| 956 | } |
| 957 | } |
| 958 | } |
| 959 | }; |
| 960 | |
| 961 | for (int i = 0, opArgIdx = 0; i != numTreeArgs; ++i, ++opArgIdx) { |
| 962 | if (auto treeArg = tree.getArgAsNestedDag(index: i)) { |
| 963 | if (treeArg.isEither()) { |
| 964 | collectSymbolInEither(tree, treeArg, opArgIdx); |
| 965 | // `either` DAG is *flattened*. For example, |
| 966 | // |
| 967 | // (FooOp (either arg0, arg1), arg2) |
| 968 | // |
| 969 | // can be viewed as: |
| 970 | // |
| 971 | // (FooOp arg0, arg1, arg2) |
| 972 | ++opArgIdx; |
| 973 | } else if (treeArg.isVariadic()) { |
| 974 | collectSymbolInVariadic(tree, treeArg, opArgIdx); |
| 975 | } else { |
| 976 | // This DAG node argument is a DAG node itself. Go inside recursively. |
| 977 | collectBoundSymbols(tree: treeArg, infoMap, isSrcPattern); |
| 978 | } |
| 979 | continue; |
| 980 | } |
| 981 | |
| 982 | if (isSrcPattern) { |
| 983 | // We can only bind symbols to op arguments in source pattern. Those |
| 984 | // symbols are referenced in result patterns. |
| 985 | auto treeArgName = tree.getArgName(index: i); |
| 986 | // `$_` is a special symbol meaning ignore the current argument. |
| 987 | if (!treeArgName.empty() && treeArgName != "_" ) { |
| 988 | LLVM_DEBUG(dbgs() << "found symbol bound to op argument: " |
| 989 | << treeArgName << '\n'); |
| 990 | verifyBind(result: infoMap.bindOpArgument(node: tree, symbol: treeArgName, op, argIndex: opArgIdx), |
| 991 | symbolName: treeArgName); |
| 992 | } |
| 993 | } |
| 994 | } |
| 995 | return; |
| 996 | } |
| 997 | |
| 998 | if (!treeName.empty()) { |
| 999 | PrintFatalError( |
| 1000 | Rec: &def, Msg: formatv(Fmt: "binding symbol '{0}' to non-operation/native code call " |
| 1001 | "unsupported right now" , |
| 1002 | Vals&: treeName)); |
| 1003 | } |
| 1004 | } |
| 1005 | |