Lines Matching defs:in
3 // found in the LICENSE file.
28 // Representation change insertion ensures that all values are in the correct
33 // backwards from uses to definitions, around cycles in phis, according
36 // possible lowering for each operator so far, and that in turn determines
101 // Reuse {VisitNode()} so the representation rules are in one place.
154 // phis can have 0, if they have not been used in a representation-inducing
170 // In the propagate phase, propagate the usage information backward.
173 // In the change phase, insert a change before the use if necessary.
414 // but that responsibility really lies in the typed lowering phase.
513 MachineTypeUnion in = GetInfo(node->InputAt(0))->output;
514 if ((in & kTypeMask) == kTypeInt32 || (in & kRepMask) == kRepWord32) {
520 // Require the input in float64 format and perform truncation.
534 MachineTypeUnion in = GetInfo(node->InputAt(0))->output;
535 if ((in & kTypeMask) == kTypeUint32 ||
536 (in & kRepMask) == kRepWord32) {
541 // Require the input in float64 format to perform truncation.
769 int count_; // number of nodes in the graph
