Lines Matching full:shifts
40 // Because shifts by negative values (which could occur if A were negative)
115 // We can often fold the shift into shifts-by-a-constant.
139 // We can often fold the shift into shifts-by-a-constant.
212 // We only accept shifts-by-a-constant in CanEvaluateShifted.
217 // If this is oversized composite shift, then unsigned shifts get 0.
248 // We only accept shifts-by-a-constant in CanEvaluateShifted.
253 // If this is oversized composite shift, then unsigned shifts get 0.
355 // confidence that the shifts will get folded together. We could do this
364 // For logical shifts, the truncation has the effect of making the high
373 // between the shifts. We want to know the effect *after* the second
535 // If this is oversized composite shift, then unsigned shifts get 0, ashr
588 // We can't handle (X << C1) >>s C2, it shifts arbitrary bits in.
614 // We can't handle (X << C1) >>a C2, it shifts arbitrary bits in.
