Lines Matching defs:that
19 // encoding of a 2*n byte compare is smaller than that of two n-byte
72 // that is a constant offset from a base value, e.g. `a` or `o.c` in the example
82 BCEAtom(BCEAtom &&that) = default;
83 BCEAtom &operator=(BCEAtom &&that) {
84 if (this == &that)
86 GEP = that.GEP;
87 LoadI = that.LoadI;
88 BaseId = that.BaseId;
89 Offset = std::move(that.Offset);
95 // To make sure that the sort order is stable, we first assign to each atom
113 // A class that assigns increasing ids to values in the order in which they are
157 // We need to make sure that we can do comparison in any order, so we
182 // left (resp. right), so that we can detect consecutive loads. To ensure this
350 // that this does not mean that this is the last incoming value, blocks
439 /// ranges that can be merged together into a single comparison.
500 // instructions that do other work in program order, i.e. within the
508 << "' that does extra work besides compare\n");
514 << "' that does extra work besides compare\n");
519 // merging only the blocks that don't do other work and resume the
632 // If there is one block that requires splitting, we do it now, i.e.
694 // so that the next block is always available to branch to.
783 // We are looking for something that has the following structure:
791 // It's the only block that contributes a non-constant value to the Phi.