Lines Matching full:logical
1 //===---- PPCReduceCRLogicals.cpp - Reduce CR Bit Logical operations ------===//
9 // This pass aims to reduce the number of logical operations on bits in the CR
13 // to hide the latency between the CR logical operation and its user.
35 "Number of single-use binary CR logical ops contained in a block");
37 "Number of binary CR logical ops that can be used to split blocks");
38 STATISTIC(TotalCRLogicals, "Number of CR logical ops.");
40 "Number of nullary CR logical ops (CRSET/CRUNSET).");
41 STATISTIC(TotalUnaryCRLogicals, "Number of unary CR logical ops.");
42 STATISTIC(TotalBinaryCRLogicals, "Number of CR logical ops.");
44 "Number of blocks split on CR binary logical ops.");
261 /// Given a CR logical operation \p CROp, branch opcode \p BROp as well as
278 llvm_unreachable("Don't know how to handle this CR logical."); in computeBranchTargetAndInversion()
314 llvm_unreachable("Don't know how to handle this CR logical."); in computeBranchTargetAndInversion()
384 // A vector to contain all the CR logical operations
513 // We now know whether all the uses of the CR logical are in the same block. in createCRLogicalOpInfo()
578 /// Contains all the implemented transformations on CR logical operations.
579 /// For example, a binary CR logical can be used to split a block on its inputs,
580 /// a unary CR logical might be used to change the condition code on a
581 /// comparison feeding it. A nullary CR logical might simply be removable
597 /// Splits a block that contains a CR-logical operation that feeds a branch
662 // of the input to the CR logical and the CR logical itself. So we move in splitBlockOnBinaryCROp()
664 // will split before the CR logical. in splitBlockOnBinaryCROp()
697 // If we've split on a CR logical that is fed by a CR logical, in splitBlockOnBinaryCROp()
698 // recompute the source CR logical as it may be usable for splitting. in splitBlockOnBinaryCROp()
732 "PowerPC Reduce CR logical Operation", false, false)
735 "PowerPC Reduce CR logical Operation", false, false)