Hi Iurii,
Without making any strict promises, we expect the coarseness of the maglev compiler to stay roughly at the level it is, with instruction-level optimisations being implemented in GenerateCode methods or Maglev/MacroAssembler helper methods.
We're also not anticipating any large changes to the pipeline from the design doc, which hasn't been updated but is still roughly accurate. The guiding principle of maglev is to have only a single IR (i.e. minimise reductions from high-level IR node to low-level IR node, preferring direct lowering to the latter node) and minimal passes. That said, we do have a second pass for trying to eliminate conversions around phis, and we _may_ want to look into non-greedy inlining at some point, which would require lowering calls into an inlined graph and propagating inlined information through the remaining graph (likely folding away constants, known branches, known checks, etc.).
Does this answer your questions? Happy to expand on these.
Leszek