Changes in GIMatchDagInstr.cpp

a396e2e0 - [utils] Use llvm::sort (NFC)

Sat, 16 Jan 2021 05:00:52 +0000

[utils] Use llvm::sort (NFC) List of files: /llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/GIMatchDagInstr.cpp

7ea2e519 - Revert "Temporarily Revert "[gicombiner] Add the MatchDag structure and parse instruction DAG's from the input""

Wed, 18 Dec 2019 10:25:19 +0000

Revert "Temporarily Revert "[gicombiner] Add the MatchDag structure and parse instruction DAG's from the input""This reverts commit e62e760f29567fe0841af870c65a4f8ef685d217.The issue @uweigand raised should have been fixed by iterating over thevector that owns the operand list data instead of the FoldingSet.The MSVC issue raised by @thakis should have been fixed by relaxing theregexes a little. I don't have a Windows machine available to test that soI tested it by using `perl -p -e 's/0x([0-9a-f]+)/\U\1\E/g' to convert theoutput of %p to the windows style.I've guessed at the issue @phosek raised as there wasn't enough informationto investigate it. What I think is happening on that bot is the -debugoption isn't available because the second stage build is a release build.I'm not sure why other release-mode bots didn't report it though. List of files: /llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/GIMatchDagInstr.cpp

390c8baa - [gicombiner] Add the MatchDag structure and parse instruction DAG's from the input

Tue, 17 Dec 2019 14:29:14 +0000

[gicombiner] Add the MatchDag structure and parse instruction DAG's from the inputSummary:The MatchDag structure is a representation of the checks that need to beperformed and the dependencies that limit when they can happen.There are two kinds of node in the MatchDag:* Instrs - Represent a MachineInstr* Predicates - Represent a check that needs to be performed (i.e. opcode, is register, same machine operand, etc.)and two kinds of edges:* (Traversal) Edges - Represent a register that can be traversed to find one instr from another* Predicate Dependency Edges - Indicate that a predicate requires a piece of information to be tested.For example, the matcher: (match (MOV $t, $s), (MOV $d, $t))with MOV declared as an instruction of the form: %dst = MOV %src1becomes the following MatchDag with the following instruction nodes: __anon0_0 // $t=getOperand(0), $s=getOperand(1) __anon0_1 // $d=getOperand(0), $t=getOperand(1)traversal edges: __anon0_1[src1] --[t]--> __anon0_0[dst]predicate nodes: <<$mi.getOpcode() == MOV>>:$__anonpred0_2 <<$mi.getOpcode() == MOV>>:$__anonpred0_3and predicate dependencies: __anon0_0 ==> __anonpred0_2[mi] __anon0_0 ==> __anonpred0_3[mi]The result of this parse is currently unused but can be testedusing -gicombiner-stop-after-parse as done in parse-match-pattern.td. Thedump for testing includes a graphviz format dump to allow the rule to beviewed visually.Later on, these MatchDag's will be used to generate code and to build anefficient decision tree.Reviewers: volkan, bognerReviewed By: volkanSubscribers: arsenm, mgorny, mgrang, llvm-commitsTags: #llvmDifferential Revision: https://reviews.llvm.org/D69077 List of files: /llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/GIMatchDagInstr.cpp