Lines Matching refs:that
19 // encoding of a 2*n byte compare is smaller than that of two n-byte
79 // that is a constant offset from a base value, e.g. `a` or `o.c` in the example
89 BCEAtom(BCEAtom &&that) = default;
90 BCEAtom &operator=(BCEAtom &&that) {
91 if (this == &that)
93 GEP = that.GEP;
94 LoadI = that.LoadI;
95 BaseId = that.BaseId;
96 Offset = std::move(that.Offset);
102 // To make sure that the sort order is stable, we first assign to each atom
120 // A class that assigns increasing ids to values in the order in which they are
168 // We need to make sure that we can do comparison in any order, so we
187 // left (resp. right), so that we can detect consecutive loads. To ensure this
257 // Disallow stores that might alias the BCE operands
363 // that this does not mean that this is the last incoming value, blocks
465 // instructions that do other work in program order, i.e. within the
473 << "' that does extra work besides compare\n");
479 << "' that does extra work besides compare\n");
484 // merging only the blocks that don't do other work and resume the
522 // Reorder blocks by LHS. We can do that without changing the
636 // If there is one block that requires splitting, we do it now, i.e.
697 // so that the next block is always available to branch to.
718 // If the old entry block was the function entry, this ensures that the new
801 // We are looking for something that has the following structure:
809 // It's the only block that contributes a non-constant value to the Phi.