| commit | cbec331e1779e85c22225917f8644b8e3525841c | [log] [tgz] |
|---|---|---|
| author | Stanislav Funiak <stano@cerebras.net> | Fri Nov 26 18:08:34 2021 +0530 |
| committer | Copybara-Service <copybara-worker@google.com> | Fri Nov 26 04:46:32 2021 -0800 |
| tree | 3723ae49828f941856ee0074ef0b449ee2e00171 | |
| parent | 1be15602c6ed72c90fa5263e5dbf5a5c28d97502 [diff] |
Introduced iterative bytecode execution. This is commit 2 of 4 for the multi-root matching in PDL, discussed in https://llvm.discourse.group/t/rfc-multi-root-pdl-patterns-for-kernel-matching/4148 (topic flagged for review). This commit implements the features needed for the execution of the new operations pdl_interp.get_accepting_ops, pdl_interp.choose_op: 1. The implementation of the generation and execution of the two ops. 2. The addition of Stack of bytecode positions within the ByteCodeExecutor. This is needed because in pdl_interp.choose_op, we iterate over the values returned by pdl_interp.get_accepting_ops until we reach finalize. When we reach finalize, we need to return back to the position marked in the stack. 3. The functionality to extend the lifetime of values that cross the nondeterministic choice. The existing bytecode generator allocates the values to memory positions by representing the liveness of values as a collection of disjoint intervals over the matcher positions. This is akin to register allocation, and substantially reduces the footprint of the bytecode executor. However, because with iterative operation pdl_interp.choose_op, execution "returns" back, so any values whose original liveness cross the nondeterminstic choice must have their lifetime executed until finalize. Testing: pdl-bytecode.mlir test Reviewed By: rriddle, Mogball Differential Revision: https://reviews.llvm.org/D108547 GitOrigin-RevId: 3eb1647af036dc0e8370ed5a8b1ecbb5701f850b
See https://mlir.llvm.org/ for more information.